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 3, 2026 21:34Victor MerckléVictor MerckléScore: 34,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 21:3434,665178,296,378168,839,0001,023,0002,117,632stderr
2Sep 3, 2026 21:3434,693179,878,308168,896,0001,104,0002,117,632stderr
3Sep 3, 2026 21:3434,703178,467,499168,953,0001,095,0002,117,632stderr
4Sep 3, 2026 21:3434,733178,615,382169,105,0001,090,0002,117,632stderr
5Sep 3, 2026 21:3434,758178,754,983169,229,0001,089,0002,117,632stderr
6Sep 3, 2026 21:3434,759178,780,981169,231,0001,092,0002,117,632stderr
7Sep 3, 2026 21:3434,776178,891,700169,143,0001,261,0002,117,632stderr
8Sep 3, 2026 21:3434,789178,911,777169,465,0001,004,0002,117,632stderr
9Sep 3, 2026 21:3434,804179,027,735169,535,0001,005,0002,117,632stderr