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 8, 2026 15:01Victor MerckléVictor MerckléScore: 33,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 15:0232,889169,020,546160,150,0001,007,00024,576stderr
2Jul 8, 2026 15:0232,929169,496,403159,315,0002,039,00024,576stderr
3Jul 8, 2026 15:0233,075170,340,228159,788,0002,283,0002,117,632stderr
4Jul 8, 2026 15:0233,425171,731,693160,478,0003,309,0002,117,632stderr
5Jul 8, 2026 15:0233,510172,278,079160,642,0003,557,00024,576stderr
6Jul 8, 2026 15:0233,694172,998,852161,523,0003,582,00024,576stderr
7Jul 8, 2026 15:0233,732173,374,639160,262,0005,028,00024,576stderr
8Jul 8, 2026 15:0233,845173,973,823160,794,0005,051,00024,576stderr
9Jul 8, 2026 15:0233,893174,231,553160,801,0005,277,00024,576stderr