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 17:07Victor MerckléVictor MerckléScore: 39,564Success
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 17:0838,848199,990,921164,823,00025,537,00024,576stderr
2Jul 7, 2026 17:0839,001198,951,149164,779,00026,326,00024,576stderr
3Jul 7, 2026 17:0839,108199,700,043164,707,00026,927,00024,576stderr
4Jul 7, 2026 17:0839,268200,279,885165,009,00027,409,00024,576stderr
5Jul 7, 2026 17:0839,564201,722,827165,165,00028,700,00024,576stderr
6Jul 7, 2026 17:0839,879203,225,401166,690,00028,719,00024,576stderr
7Jul 7, 2026 17:0840,068204,206,064166,785,00029,550,00028,672stderr
8Jul 7, 2026 17:0841,197209,739,191168,879,00032,989,00024,576stderr
9Jul 7, 2026 17:0841,700212,588,825169,889,00034,445,00028,672stderr