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 09:42Victor MerckléVictor MerckléScore: 25,981Success
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 09:4225,969136,491,194126,161,0001,089,0002,117,632stderr
2Sep 2, 2026 09:4225,970135,546,659126,158,0001,099,0002,117,632stderr
3Sep 2, 2026 09:4225,972135,646,873126,174,0001,091,0002,117,632stderr
4Sep 2, 2026 09:4225,972135,704,906126,165,0001,100,0002,117,632stderr
5Sep 2, 2026 09:4225,981135,706,632126,206,0001,102,0002,117,632stderr
6Sep 2, 2026 09:4225,983135,773,928126,229,0001,091,0002,117,632stderr
7Sep 2, 2026 09:4225,984135,808,314126,241,0001,084,0002,117,632stderr
8Sep 2, 2026 09:4225,985135,837,895126,235,0001,094,0002,117,632stderr
9Sep 2, 2026 09:4225,987135,884,317126,224,0001,117,0002,117,632stderr