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 00:44Victor MerckléVictor MerckléScore: 27,022Success
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 00:4526,921140,520,846130,882,0001,034,0002,117,632stderr
2Sep 2, 2026 00:4526,983140,648,653131,127,0001,091,0002,117,632stderr
3Sep 2, 2026 00:4526,997140,689,741131,189,0001,101,0002,117,632stderr
4Sep 2, 2026 00:4527,020140,806,626131,301,0001,099,0002,117,632stderr
5Sep 2, 2026 00:4527,022140,851,427131,313,0001,096,0002,117,632stderr
6Sep 2, 2026 00:4527,025140,908,412131,328,0001,099,0002,117,632stderr
7Sep 2, 2026 00:4527,030140,768,021131,403,0001,048,0002,117,632stderr
8Sep 2, 2026 00:4527,050141,609,344131,451,0001,098,0002,117,632stderr
9Sep 2, 2026 00:4527,071141,105,811131,555,0001,096,0002,117,632stderr