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 04:05Victor MerckléVictor MerckléScore: 26,865Success
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 04:0626,844141,191,910130,516,0001,022,0002,117,632stderr
2Sep 2, 2026 04:0626,857140,020,417130,514,0001,089,0002,117,632stderr
3Sep 2, 2026 04:0626,858140,004,933130,514,0001,093,0002,117,632stderr
4Sep 2, 2026 04:0626,864140,115,807130,546,0001,091,0002,117,632stderr
5Sep 2, 2026 04:0626,865140,065,586130,549,0001,090,0002,117,632stderr
6Sep 2, 2026 04:0626,867140,068,683130,554,0001,098,0002,117,632stderr
7Sep 2, 2026 04:0626,868139,827,334130,559,0001,095,0002,117,632stderr
8Sep 2, 2026 04:0626,869140,084,137130,557,0001,102,0002,117,632stderr
9Sep 2, 2026 04:0626,873140,098,487130,579,0001,100,0002,117,632stderr