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 27, 2026 12:25Kevin HeaveyKevin HeaveyScore: 55,027Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 12:3054,666277,813,792259,127,0008,737,00020,480
2Jul 27, 2026 12:3054,751278,306,124259,280,0009,001,00020,480
3Jul 27, 2026 12:3054,752278,246,301259,113,0009,172,00020,480
4Jul 27, 2026 12:3054,987279,482,444259,382,00010,055,00020,480
5Jul 27, 2026 12:3055,027279,842,811259,162,00010,472,00020,480
6Jul 27, 2026 12:3055,080279,987,481259,162,00010,734,00020,480
7Jul 27, 2026 12:3055,096281,834,329259,208,00010,767,00020,480
8Jul 27, 2026 12:3055,112280,721,046259,289,00010,760,00020,480
9Jul 27, 2026 12:3055,116280,077,358258,893,00011,180,00020,480