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 7, 2026 16:52Victor MerckléVictor MerckléScore: 32,007Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 16:5331,604164,730,155152,837,0002,026,0002,117,632stderr
2Jul 7, 2026 16:5331,811163,680,105152,769,0003,106,00024,576stderr
3Jul 7, 2026 16:5331,822163,808,024153,919,0002,010,00024,576stderr
4Jul 7, 2026 16:5331,922164,286,483152,611,0003,809,0002,117,632stderr
5Jul 7, 2026 16:5332,007164,710,492154,826,0002,012,00024,576stderr
6Jul 7, 2026 16:5332,061164,925,072155,088,0002,013,00024,576stderr
7Jul 7, 2026 16:5334,022174,615,118156,349,00010,361,00024,576stderr
8Jul 7, 2026 16:5334,515179,186,666158,646,00010,482,00024,576stderr
9Jul 7, 2026 16:5334,980179,354,711158,964,00012,442,00024,576stderr