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 17:55Victor MerckléVictor MerckléScore: 43,749Success
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 17:5643,630224,193,385207,632,0006,158,0002,117,632stderr
2Jul 5, 2026 17:5643,645221,887,913208,111,0005,750,00024,576stderr
3Jul 5, 2026 17:5643,664221,965,028208,034,0005,922,00024,576stderr
4Jul 5, 2026 17:5643,727222,294,049208,875,0005,388,00024,576stderr
5Jul 5, 2026 17:5643,749222,383,347208,802,0005,571,0002,117,632stderr
6Jul 5, 2026 17:5643,760222,431,004208,731,0005,697,0002,117,632stderr
7Jul 5, 2026 17:5643,776222,505,119208,279,0006,224,00024,576stderr
8Jul 5, 2026 17:5644,035223,781,328209,539,0006,234,00024,576stderr
9Jul 5, 2026 17:5644,123224,159,409210,803,0005,404,00024,576stderr