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:10Victor MerckléVictor MerckléScore: 40,581Success
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:1139,825203,279,830194,138,0001,007,0002,117,632stderr
2Jul 5, 2026 18:1140,252205,026,189196,230,0001,005,0002,117,632stderr
3Jul 5, 2026 18:1140,387206,325,328196,893,0001,006,0002,117,632stderr
4Jul 5, 2026 18:1140,536206,649,548197,622,0001,005,0002,117,632stderr
5Jul 5, 2026 18:1140,581206,864,185197,843,0001,006,0002,117,632stderr
6Jul 5, 2026 18:1140,762208,407,687198,728,0001,007,0002,117,632stderr
7Jul 5, 2026 18:1140,810208,034,213197,933,0002,037,0002,117,632stderr
8Jul 5, 2026 18:1140,838207,895,384198,083,0002,024,0002,117,632stderr
9Jul 5, 2026 18:1141,327210,519,393201,497,0001,006,0002,117,632stderr