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 5, 2026 20:23Victor MerckléVictor MerckléScore: 34,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 20:2434,486177,005,219167,977,0001,007,00024,576stderr
2Jul 5, 2026 20:2434,499177,062,414168,043,0001,006,00024,576stderr
3Jul 5, 2026 20:2434,566177,618,147168,369,0001,008,00024,576stderr
4Jul 5, 2026 20:2434,615177,460,530167,299,0002,316,0002,117,632stderr
5Jul 5, 2026 20:2434,760178,386,652169,320,0001,005,00024,576stderr
6Jul 5, 2026 20:2434,769178,442,776168,360,0002,011,00024,576stderr
7Jul 5, 2026 20:2434,776178,452,027169,397,0001,007,00024,576stderr
8Jul 5, 2026 20:2435,388181,515,921170,987,0002,418,0002,117,632stderr
9Jul 5, 2026 20:2435,545182,260,259171,865,0002,309,0002,117,632stderr