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 1, 2026 22:34Victor MerckléVictor MerckléScore: 49,607Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 22:3549,534250,635,039240,703,0002,018,0002,117,632stderr
2Jul 1, 2026 22:3549,552250,763,456240,765,0002,041,0002,117,632stderr
3Jul 1, 2026 22:3549,561250,745,910241,846,0001,007,0002,117,632stderr
4Jul 1, 2026 22:3549,585250,912,532240,948,0002,021,0002,117,632stderr
5Jul 1, 2026 22:3549,607251,371,350242,067,0001,008,0002,117,632stderr
6Jul 1, 2026 22:3549,877252,336,350243,396,0001,005,0002,117,632stderr
7Jul 1, 2026 22:3549,880252,350,461243,407,0001,006,0002,117,632stderr
8Jul 1, 2026 22:3549,995252,844,611242,967,0002,009,0002,117,632stderr
9Jul 1, 2026 22:3551,418259,844,455249,929,0002,024,0002,117,632stderr