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 9, 2026 09:48Victor MerckléVictor MerckléScore: 33,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 09:4833,091170,202,105161,142,0001,006,0002,117,632stderr
2Jul 9, 2026 09:4833,151170,313,016161,436,0001,005,0002,117,632stderr
3Jul 9, 2026 09:4833,170170,621,871161,528,0001,006,0002,117,632stderr
4Jul 9, 2026 09:4833,247171,035,075161,904,0001,007,0002,117,632stderr
5Jul 9, 2026 09:4833,268170,899,130162,008,0001,006,0002,117,632stderr
6Jul 9, 2026 09:4833,311171,556,387162,217,0001,008,0002,117,632stderr
7Jul 9, 2026 09:4833,397171,514,789162,643,0001,006,0002,117,632stderr
8Jul 9, 2026 09:4833,450171,969,587162,899,0001,007,0002,117,632stderr
9Jul 9, 2026 09:4833,465171,818,171162,974,0001,007,0002,117,632stderr