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 5, 2026 18:00Victor MerckléVictor MerckléScore: 41,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 18:0140,665207,402,316197,243,0002,018,0002,117,632stderr
2Jul 5, 2026 18:0140,765207,586,468198,743,0001,006,0002,117,632stderr
3Jul 5, 2026 18:0141,057215,923,814200,176,0001,006,0002,117,632stderr
4Jul 5, 2026 18:0141,221209,994,616200,980,0001,006,0002,117,632stderr
5Jul 5, 2026 18:0141,362217,961,157200,550,0002,124,0002,117,632stderr
6Jul 5, 2026 18:0141,787214,170,470202,738,0002,021,0002,117,632stderr
7Jul 5, 2026 18:0141,794212,752,578203,787,0001,006,0002,117,632stderr
8Jul 5, 2026 18:0142,028213,927,652204,933,0001,007,0002,117,632stderr
9Jul 5, 2026 18:0142,428215,762,333206,893,0001,007,0002,117,632stderr