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 listSep 2, 2026 01:15Victor MerckléVictor MerckléScore: 28,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 01:1728,081146,027,965136,499,0001,099,0002,117,632stderr
2Sep 2, 2026 01:1728,085146,148,706136,524,0001,097,0002,117,632stderr
3Sep 2, 2026 01:1728,087146,126,149136,532,0001,099,0002,117,632stderr
4Sep 2, 2026 01:1728,093146,103,691136,564,0001,095,0002,117,632stderr
5Sep 2, 2026 01:1728,105146,171,426136,622,0001,095,0002,117,632stderr
6Sep 2, 2026 01:1728,113146,253,929136,635,0001,120,0002,117,632stderr
7Sep 2, 2026 01:1728,127146,200,338136,714,0001,113,0002,117,632stderr
8Sep 2, 2026 01:1728,134146,329,914136,766,0001,091,0002,117,632stderr
9Sep 2, 2026 01:1728,154147,853,220136,953,0001,005,0002,117,632stderr