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 21:31Victor MerckléVictor MerckléScore: 38,775Success
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 21:3238,334195,636,774169,481,00018,357,0002,117,632stderr
2Jul 5, 2026 21:3238,486196,359,113169,682,00018,902,0002,117,632stderr
3Jul 5, 2026 21:3238,513196,571,723169,815,00018,899,0002,117,632stderr
4Jul 5, 2026 21:3238,731197,577,733169,783,00020,000,0002,117,632stderr
5Jul 5, 2026 21:3238,775198,049,620170,750,00019,252,00024,576stderr
6Jul 5, 2026 21:3238,860198,586,048170,647,00019,769,0002,117,632stderr
7Jul 5, 2026 21:3239,063199,192,542172,063,00019,350,00024,576stderr
8Jul 5, 2026 21:3264,742857,011,958221,065,00096,175,00024,576stderr
9Jul 5, 2026 21:3271,9811,015,294,959234,256,000118,453,0002,117,632stderr