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 5, 2026 21:11Victor MerckléVictor MerckléScore: 34,512Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 21:1234,297175,892,129165,954,0002,103,0002,117,632stderr
2Jul 5, 2026 21:1234,356176,251,935166,093,0002,253,0002,117,632stderr
3Jul 5, 2026 21:1234,374176,212,673166,103,0002,330,0002,117,632stderr
4Jul 5, 2026 21:1234,488176,874,917166,760,0002,232,0002,117,632stderr
5Jul 5, 2026 21:1234,512176,980,662166,045,0003,064,0002,117,632stderr
6Jul 5, 2026 21:1234,567178,987,449167,356,0002,024,00024,576stderr
7Jul 5, 2026 21:1234,591177,321,046167,348,0002,149,0002,117,632stderr
8Jul 5, 2026 21:1234,595177,349,134166,304,0003,214,0002,117,632stderr
9Jul 5, 2026 21:1234,793178,376,834167,331,0003,157,0002,117,632stderr