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 4, 2026 00:25Victor MerckléVictor MerckléScore: 25,198Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 00:2625,144131,671,316122,191,0001,019,0002,117,632stderr
2Sep 4, 2026 00:2625,156131,722,778122,197,0001,069,0002,117,632stderr
3Sep 4, 2026 00:2625,181133,040,729122,291,0001,096,0002,117,632stderr
4Sep 4, 2026 00:2625,188131,906,238122,332,0001,093,0002,117,632stderr
5Sep 4, 2026 00:2625,198132,005,246122,373,0001,101,0002,117,632stderr
6Sep 4, 2026 00:2625,210132,027,106122,392,0001,139,0002,117,632stderr
7Sep 4, 2026 00:2625,213132,062,740122,434,0001,113,0002,117,632stderr
8Sep 4, 2026 00:2625,214131,982,429122,458,0001,093,0002,117,632stderr
9Sep 4, 2026 00:2625,217132,025,903122,466,0001,101,0002,117,632stderr