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 19:05Victor MerckléVictor MerckléScore: 38,679Success
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 19:0638,208195,029,029183,996,0003,226,00024,576stderr
2Jul 5, 2026 19:0638,373196,072,946184,851,0003,181,00024,576stderr
3Jul 5, 2026 19:0638,424196,296,561185,260,0003,018,00024,576stderr
4Jul 5, 2026 19:0638,593197,125,247187,094,0002,016,00024,576stderr
5Jul 5, 2026 19:0638,679197,565,241186,467,0003,062,00024,576stderr
6Jul 5, 2026 19:0638,822199,617,597185,662,0004,567,00024,576stderr
7Jul 5, 2026 19:0638,846198,354,876185,569,0004,781,00024,576stderr
8Jul 5, 2026 19:0639,040199,341,668189,283,0002,015,00024,576stderr
9Jul 5, 2026 19:0639,163199,925,235186,663,0005,237,00024,576stderr