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:42Victor MerckléVictor MerckléScore: 33,953Success
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:4333,863173,717,456163,915,0002,016,00024,576stderr
2Jul 5, 2026 21:4333,918173,962,187163,725,0002,477,00024,576stderr
3Jul 5, 2026 21:4333,932174,017,597163,840,0002,431,00024,576stderr
4Jul 5, 2026 21:4333,946174,117,978164,302,0002,036,00024,576stderr
5Jul 5, 2026 21:4333,953174,129,368163,826,0002,548,00024,576stderr
6Jul 5, 2026 21:4333,958174,177,180164,380,0002,017,00024,576stderr
7Jul 5, 2026 21:4333,975174,291,670164,462,0002,018,00024,576stderr
8Jul 5, 2026 21:4334,189175,491,859164,272,0003,258,00024,576stderr
9Jul 5, 2026 21:4334,312175,882,644165,103,0003,027,00024,576stderr