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 17:46Victor MerckléVictor MerckléScore: 25,520Success
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 17:4725,468133,246,793123,784,0001,012,0002,117,632stderr
2Sep 3, 2026 17:4725,472133,289,650123,769,0001,048,0002,117,632stderr
3Sep 3, 2026 17:4725,489133,353,068123,804,0001,094,0002,117,632stderr
4Sep 3, 2026 17:4725,512133,447,379123,914,0001,097,0002,117,632stderr
5Sep 3, 2026 17:4725,520133,521,915123,904,0001,147,0002,117,632stderr
6Sep 3, 2026 17:4725,520133,584,772123,940,0001,110,0002,117,632stderr
7Sep 3, 2026 17:4725,521133,513,455123,956,0001,099,0002,117,632stderr
8Sep 3, 2026 17:4725,529133,548,819123,889,0001,204,0002,117,632stderr
9Sep 3, 2026 17:4725,535133,649,151124,022,0001,101,0002,117,632stderr