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 22:46Victor MerckléVictor MerckléScore: 25,255Success
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 22:4725,208131,993,635122,485,0001,039,0002,117,632stderr
2Sep 3, 2026 22:4725,217133,315,551122,536,0001,030,0002,117,632stderr
3Sep 3, 2026 22:4725,226132,072,233122,582,0001,026,0002,117,632stderr
4Sep 3, 2026 22:4725,245132,438,074122,597,0001,108,0002,117,632stderr
5Sep 3, 2026 22:4725,255132,180,273122,660,0001,093,0002,117,632stderr
6Sep 3, 2026 22:4725,264132,301,644122,694,0001,100,0002,117,632stderr
7Sep 3, 2026 22:4725,280132,334,011122,776,0001,098,0002,117,632stderr
8Sep 3, 2026 22:4725,281132,718,672122,773,0001,105,0002,117,632stderr
9Sep 3, 2026 22:4725,287133,003,016122,763,0001,147,0002,117,632stderr