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 listJun 17, 2026 13:24Victor MerckléVictor MerckléScore: 129,419Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 13:25126,208627,764,956616,418,0002,004,0002,113,536
2Jun 17, 2026 13:25127,825635,540,973624,336,0002,011,0002,113,536
3Jun 17, 2026 13:25128,231637,497,876626,182,0002,154,0002,113,536
4Jun 17, 2026 13:25128,749639,925,971628,866,0002,005,0002,113,536
5Jun 17, 2026 13:25129,419643,238,909632,008,0002,149,0002,113,536
6Jun 17, 2026 13:25132,573658,764,087647,377,0002,233,0002,113,536
7Jun 17, 2026 13:25133,995665,766,104654,404,0002,172,0002,113,536
8Jun 17, 2026 13:25134,045666,071,231654,672,0002,153,0002,113,536
9Jun 17, 2026 13:25135,228671,805,459660,405,0002,214,0002,113,536