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 20, 2026 15:58M-RochatM-RochatScore: 110,509Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 15:58110,391553,024,290539,796,0001,123,0002,113,536
2May 20, 2026 15:58110,478552,652,763540,217,0001,128,0002,113,536
3May 20, 2026 15:58110,488551,107,732540,274,0001,120,0002,113,536
4May 20, 2026 15:58110,490551,511,131540,276,0001,129,0002,113,536
5May 20, 2026 15:58110,509552,357,555540,370,0001,125,0002,113,536
6May 20, 2026 15:58110,942553,594,704542,499,0001,120,0002,113,536
7May 20, 2026 15:58111,058556,679,726543,060,0001,127,0002,113,536
8May 20, 2026 15:58113,550568,599,747555,270,0001,129,0002,113,536
9May 20, 2026 15:58114,328571,330,338559,079,0001,130,0002,113,536