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 listMay 22, 2026 20:41M-RochatM-RochatScore: 112,042Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 20:42111,936558,274,164547,365,0001,124,0002,158,592
2May 22, 2026 20:42111,949558,557,282547,429,0001,124,0002,150,400
3May 22, 2026 20:42111,955558,717,513547,450,0001,134,0002,158,592
4May 22, 2026 20:42111,977559,630,548547,551,0001,138,0002,158,592
5May 22, 2026 20:42112,042558,802,445547,873,0001,137,0002,150,400
6May 22, 2026 20:42112,092560,080,095548,120,0001,135,0002,150,400
7May 22, 2026 20:42112,121563,008,464548,226,0001,171,0002,138,112
8May 22, 2026 20:42112,157561,944,925548,424,0001,147,0002,150,400
9May 22, 2026 20:42112,198559,703,833548,638,0001,137,0002,150,400