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 23:10Victor MerckléVictor MerckléScore: 50,103Success
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 23:1150,082253,263,235244,400,0001,006,0002,117,632stderr
2Jul 1, 2026 23:1150,091253,325,217243,439,0002,008,0002,117,632stderr
3Jul 1, 2026 23:1150,094253,392,915243,435,0002,028,0002,117,632stderr
4Jul 1, 2026 23:1150,095253,333,530244,459,0001,007,0002,117,632stderr
5Jul 1, 2026 23:1150,103253,410,037243,489,0002,017,0002,117,632stderr
6Jul 1, 2026 23:1150,122253,295,389243,593,0002,006,0002,117,632stderr
7Jul 1, 2026 23:1150,160253,671,815243,726,0002,062,0002,117,632stderr
8Jul 1, 2026 23:1150,170253,727,643244,828,0001,008,0002,117,632stderr
9Jul 1, 2026 23:1150,184253,651,670243,864,0002,042,0002,117,632stderr