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 20:46Victor MerckléVictor MerckléScore: 36,104Success
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 20:4735,870183,943,046174,761,0001,006,0002,117,632stderr
2Jul 5, 2026 20:4735,900184,068,831174,906,0001,007,0002,117,632stderr
3Jul 5, 2026 20:4735,951184,261,884175,156,0001,007,0002,117,632stderr
4Jul 5, 2026 20:4736,057184,793,544174,660,0002,023,0002,117,632stderr
5Jul 5, 2026 20:4736,104184,928,873175,905,0001,006,0002,117,632stderr
6Jul 5, 2026 20:4736,211185,619,849176,428,0001,006,0002,117,632stderr
7Jul 5, 2026 20:4736,280185,892,034176,768,0001,007,0002,117,632stderr
8Jul 5, 2026 20:4736,328186,142,099175,991,0002,018,0002,117,632stderr
9Jul 5, 2026 20:4736,389186,422,768177,301,0001,007,0002,117,632stderr