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 4, 2026 15:36Victor MerckléVictor MerckléScore: 55,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 15:3755,194278,437,555268,435,0002,019,0002,117,632stderr
2Jul 4, 2026 15:3755,257278,865,872268,661,0002,099,0002,117,632stderr
3Jul 4, 2026 15:3755,296278,981,512268,922,0002,030,0002,117,632stderr
4Jul 4, 2026 15:3755,306279,282,452268,984,0002,019,0002,117,632stderr
5Jul 4, 2026 15:3755,335279,138,554269,082,0002,060,0002,117,632stderr
6Jul 4, 2026 15:3755,338279,445,002269,024,0002,135,0002,117,632stderr
7Jul 4, 2026 15:3755,408279,568,331269,330,0002,173,0002,117,632stderr
8Jul 4, 2026 15:3755,432279,645,666269,496,0002,124,0002,117,632stderr
9Jul 4, 2026 15:3755,581280,332,582270,269,0002,082,0002,117,632stderr