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 6, 2026 14:00Victor MerckléVictor MerckléScore: 35,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 14:0635,582182,135,761173,349,0001,007,0002,117,632stderr
2Jul 6, 2026 14:0635,801183,546,767174,422,0001,006,0002,117,632stderr
3Jul 6, 2026 14:0635,812183,247,441174,475,0001,006,0002,117,632stderr
4Jul 6, 2026 14:0635,819183,329,073174,506,0001,008,0002,117,632stderr
5Jul 6, 2026 14:0635,903183,937,522174,923,0001,005,0002,117,632stderr
6Jul 6, 2026 14:0636,003185,955,475175,409,0001,006,0002,117,632stderr
7Jul 6, 2026 14:0636,016184,283,923175,476,0001,007,0002,117,632stderr
8Jul 6, 2026 14:0636,041184,392,533175,596,0001,005,0002,117,632stderr
9Jul 6, 2026 14:0636,312185,776,727176,926,0001,005,0002,117,632stderr