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 00:10Victor MerckléVictor MerckléScore: 27,396Success
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 00:1327,327142,341,679132,893,0001,011,0002,117,632stderr
2Sep 2, 2026 00:1327,385143,287,991133,106,0001,085,0002,117,632stderr
3Sep 2, 2026 00:1327,389142,647,962133,103,0001,107,0002,117,632stderr
4Sep 2, 2026 00:1327,390142,549,120133,110,0001,104,0002,117,632stderr
5Sep 2, 2026 00:1327,396142,729,355133,137,0001,105,0002,117,632stderr
6Sep 2, 2026 00:1327,397143,942,044133,129,0001,117,0002,117,632stderr
7Sep 2, 2026 00:1327,399142,682,931133,150,0001,109,0002,117,632stderr
8Sep 2, 2026 00:1327,401142,645,377133,173,0001,093,0002,117,632stderr
9Sep 2, 2026 00:1327,418142,823,944133,238,0001,115,0002,117,632stderr