Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listJul 31, 2026 21:17anboto1anboto1Score: 151,931Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 21:17151,824754,005,603742,827,0001,114,0002,113,536
2Jul 31, 2026 21:17151,831754,004,894742,851,0001,121,0002,113,536
3Jul 31, 2026 21:17151,848754,052,764742,946,0001,114,0002,113,536
4Jul 31, 2026 21:17151,925754,370,392743,305,0001,128,0002,113,536
5Jul 31, 2026 21:17151,931755,700,493743,333,0001,129,0002,113,536
6Jul 31, 2026 21:17152,071754,972,816744,022,0001,129,0002,113,536
7Jul 31, 2026 21:17152,099755,179,992744,177,0001,112,0002,113,536
8Jul 31, 2026 21:17152,132755,378,608744,317,0001,131,0002,113,536
9Jul 31, 2026 21:17152,470757,106,063745,993,0001,114,0002,113,536