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 13:41Victor MerckléVictor MerckléScore: 27,877Success
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 13:4127,858144,963,333135,418,0001,090,0002,117,632stderr
2Sep 2, 2026 13:4127,860144,969,943135,425,0001,093,0002,117,632stderr
3Sep 2, 2026 13:4127,862144,939,684135,435,0001,089,0002,117,632stderr
4Sep 2, 2026 13:4127,868146,208,954135,452,0001,105,0002,117,632stderr
5Sep 2, 2026 13:4127,877145,061,388135,501,0001,100,0002,117,632stderr
6Sep 2, 2026 13:4127,880145,055,378135,506,0001,108,0002,117,632stderr
7Sep 2, 2026 13:4127,890145,038,833135,573,0001,090,0002,117,632stderr
8Sep 2, 2026 13:4127,890145,077,284135,560,0001,105,0002,117,632stderr
9Sep 2, 2026 13:4127,904145,001,475135,477,0001,257,0002,117,632stderr