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:17Victor MerckléVictor MerckléScore: 33,408Success
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:2133,288170,949,250162,111,0001,005,0002,117,632stderr
2Jul 6, 2026 14:2133,293170,933,986162,131,0001,006,0002,117,632stderr
3Jul 6, 2026 14:2133,316171,170,602161,222,0002,031,0002,117,632stderr
4Jul 6, 2026 14:2133,319171,100,417162,259,0001,006,0002,117,632stderr
5Jul 6, 2026 14:2133,408171,425,284162,695,0001,005,0002,117,632stderr
6Jul 6, 2026 14:2133,460171,738,709162,951,0001,006,0002,117,632stderr
7Jul 6, 2026 14:2133,491171,915,756163,102,0001,007,0002,117,632stderr
8Jul 6, 2026 14:2133,508172,010,736163,183,0001,007,0002,117,632stderr
9Jul 6, 2026 14:2134,029174,499,175165,740,0001,005,0002,117,632stderr