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 3, 2026 06:11Victor MerckléVictor MerckléScore: 48,155Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 06:1248,111243,726,479234,741,0001,006,0002,117,632stderr
2Jul 3, 2026 06:1248,116243,685,430234,764,0001,007,0002,117,632stderr
3Jul 3, 2026 06:1248,122243,817,193233,778,0002,023,0002,117,632stderr
4Jul 3, 2026 06:1248,124244,002,071233,775,0002,037,0002,117,632stderr
5Jul 3, 2026 06:1248,155243,851,525233,955,0002,007,0002,117,632stderr
6Jul 3, 2026 06:1248,257244,314,010234,328,0002,132,0002,117,632stderr
7Jul 3, 2026 06:1248,293244,606,686234,596,0002,041,0002,117,632stderr
8Jul 3, 2026 06:1248,411245,082,918235,205,0002,012,0002,117,632stderr
9Jul 3, 2026 06:1250,396254,659,953244,937,0002,006,0002,117,632stderr