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 listJul 3, 2026 22:19Victor MerckléVictor MerckléScore: 62,428Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 22:2062,285313,458,827303,102,0002,097,0002,117,632stderr
2Jul 3, 2026 22:2062,328325,745,795303,385,0002,023,0002,117,632stderr
3Jul 3, 2026 22:2062,332313,491,760303,278,0002,152,0002,117,632stderr
4Jul 3, 2026 22:2062,392313,696,544303,541,0002,183,0002,117,632stderr
5Jul 3, 2026 22:2062,428314,177,010303,740,0002,159,0002,117,632stderr
6Jul 3, 2026 22:2062,489314,440,735304,061,0002,137,0002,117,632stderr
7Jul 3, 2026 22:2062,583314,932,228304,515,0002,146,0002,117,632stderr
8Jul 3, 2026 22:2062,642314,836,212304,798,0002,152,0002,117,632stderr
9Jul 3, 2026 22:2062,693315,112,345305,091,0002,106,0002,117,632stderr