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 23:23Victor MerckléVictor MerckléScore: 25,648Success
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 23:2425,606133,895,148124,447,0001,025,0002,117,632stderr
2Sep 3, 2026 23:2425,629134,165,195124,478,0001,108,0002,117,632stderr
3Sep 3, 2026 23:2425,642134,140,694124,552,0001,096,0002,117,632stderr
4Sep 3, 2026 23:2425,645134,581,338124,580,0001,085,0002,117,632stderr
5Sep 3, 2026 23:2425,648134,215,263124,642,0001,034,0002,117,632stderr
6Sep 3, 2026 23:2425,660134,273,402124,641,0001,097,0002,117,632stderr
7Sep 3, 2026 23:2425,666134,268,190124,665,0001,099,0002,117,632stderr
8Sep 3, 2026 23:2425,679134,278,811124,735,0001,095,0002,117,632stderr
9Sep 3, 2026 23:2425,862135,170,582124,712,0002,016,0002,117,632stderr