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:52Victor MerckléVictor MerckléScore: 26,024Success
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:5225,996136,056,216126,299,0001,083,0002,117,632stderr
2Sep 3, 2026 21:5226,003136,342,017126,293,0001,126,0002,117,632stderr
3Sep 3, 2026 21:5226,011135,919,355126,368,0001,088,0002,117,632stderr
4Sep 3, 2026 21:5226,020136,650,631126,392,0001,107,0002,117,632stderr
5Sep 3, 2026 21:5226,024135,947,358126,314,0001,204,0002,117,632stderr
6Sep 3, 2026 21:5226,024135,967,622126,407,0001,114,0002,117,632stderr
7Sep 3, 2026 21:5226,028136,036,794126,421,0001,118,0002,117,632stderr
8Sep 3, 2026 21:5226,038136,015,786126,499,0001,091,0002,117,632stderr
9Sep 3, 2026 21:5226,038136,099,681126,471,0001,117,0002,117,632stderr