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:54Victor MerckléVictor MerckléScore: 25,364Success
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:5525,327132,947,754123,086,0001,021,0002,117,632stderr
2Sep 3, 2026 21:5525,359132,739,351123,163,0001,099,0002,117,632stderr
3Sep 3, 2026 21:5525,360132,712,244123,173,0001,092,0002,117,632stderr
4Sep 3, 2026 21:5525,360132,710,003123,151,0001,116,0002,117,632stderr
5Sep 3, 2026 21:5525,364132,736,274123,196,0001,090,0002,117,632stderr
6Sep 3, 2026 21:5525,373132,825,705123,237,0001,095,0002,117,632stderr
7Sep 3, 2026 21:5525,382132,913,024123,282,0001,093,0002,117,632stderr
8Sep 3, 2026 21:5525,392132,867,661123,328,0001,095,0002,117,632stderr
9Sep 3, 2026 21:5525,407133,019,345123,303,0001,193,0002,117,632stderr