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 10:31Victor MerckléVictor MerckléScore: 25,909Success
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 10:3225,865135,835,490125,726,0001,017,0002,117,632stderr
2Sep 2, 2026 10:3225,886135,672,509125,761,0001,082,0002,117,632stderr
3Sep 2, 2026 10:3225,894136,023,459125,775,0001,106,0002,117,632stderr
4Sep 2, 2026 10:3225,900135,285,875125,812,0001,098,0002,117,632stderr
5Sep 2, 2026 10:3225,909137,317,341125,851,0001,104,0002,117,632stderr
6Sep 2, 2026 10:3225,914135,437,423125,889,0001,090,0002,117,632stderr
7Sep 2, 2026 10:3225,914135,548,641125,886,0001,097,0002,117,632stderr
8Sep 2, 2026 10:3225,914135,429,774125,871,0001,112,0002,117,632stderr
9Sep 2, 2026 10:3225,922135,206,511125,933,0001,087,0002,117,632stderr