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 4, 2026 22:24Victor MerckléVictor MerckléScore: 46,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 22:2546,677236,532,934226,685,0002,036,0002,117,632stderr
2Jul 4, 2026 22:2546,679237,097,695226,673,0002,057,0002,117,632stderr
3Jul 4, 2026 22:2546,689236,610,929226,750,0002,030,0002,117,632stderr
4Jul 4, 2026 22:2546,711236,765,695226,874,0002,011,0002,117,632stderr
5Jul 4, 2026 22:2546,763236,835,670227,127,0002,013,0002,117,632stderr
6Jul 4, 2026 22:2546,789237,051,503227,214,0002,055,0002,117,632stderr
7Jul 4, 2026 22:2546,893237,932,203227,767,0002,010,0002,117,632stderr
8Jul 4, 2026 22:2546,912237,598,615227,851,0002,022,0002,117,632stderr
9Jul 4, 2026 22:2546,997237,978,904228,262,0002,025,0002,117,632stderr