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 12:30Victor MerckléVictor MerckléScore: 49,292Success
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 12:3049,214249,186,246239,098,0002,054,0002,117,632stderr
2Jul 5, 2026 12:3049,276249,228,611239,380,0002,073,0002,117,632stderr
3Jul 5, 2026 12:3049,286249,544,527239,485,0002,020,0002,117,632stderr
4Jul 5, 2026 12:3049,290249,560,166239,409,0002,115,0002,117,632stderr
5Jul 5, 2026 12:3049,292249,472,645239,466,0002,065,0002,117,632stderr
6Jul 5, 2026 12:3049,486250,404,454240,443,0002,040,0002,117,632stderr
7Jul 5, 2026 12:3049,941252,686,332242,618,0002,097,0002,117,632stderr
8Jul 5, 2026 12:3051,797262,089,883251,746,0002,063,0002,117,632stderr
9Jul 5, 2026 12:3054,848276,554,731266,627,0002,133,0002,117,632stderr