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 12:03Victor MerckléVictor MerckléScore: 26,125Success
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 12:0326,122136,445,561126,909,0001,089,0002,117,632stderr
2Sep 2, 2026 12:0326,124137,088,208126,904,0001,105,0002,117,632stderr
3Sep 2, 2026 12:0326,124136,316,728126,922,0001,090,0002,117,632stderr
4Sep 2, 2026 12:0326,124136,505,852126,895,0001,115,0002,117,632stderr
5Sep 2, 2026 12:0326,125136,513,191126,913,0001,101,0002,117,632stderr
6Sep 2, 2026 12:0326,130136,492,731126,888,0001,153,0002,117,632stderr
7Sep 2, 2026 12:0326,139136,493,294126,889,0001,195,0002,117,632stderr
8Sep 2, 2026 12:0326,143136,561,569127,010,0001,094,0002,117,632stderr
9Sep 2, 2026 12:0326,167137,336,391126,936,0001,283,0002,117,632stderr