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 4, 2026 07:18Victor MerckléVictor MerckléScore: 25,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 07:2225,444133,079,070123,649,0001,031,0002,117,632stderr
2Sep 4, 2026 07:2225,444133,085,100123,612,0001,067,0002,117,632stderr
3Sep 4, 2026 07:2225,454133,438,618123,604,0001,124,0002,117,632stderr
4Sep 4, 2026 07:2225,454133,096,198123,589,0001,138,0002,117,632stderr
5Sep 4, 2026 07:2225,455133,197,596123,625,0001,107,0002,117,632stderr
6Sep 4, 2026 07:2225,456133,127,571123,582,0001,155,0002,117,632stderr
7Sep 4, 2026 07:2225,460133,204,449123,659,0001,096,0002,117,632stderr
8Sep 4, 2026 07:2225,513134,124,307123,802,0001,215,0002,117,632stderr
9Sep 4, 2026 07:2225,564134,353,694124,162,0001,105,0002,117,632stderr