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 13:45Victor MerckléVictor MerckléScore: 34,731Success
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 13:4634,588177,556,073168,476,0001,006,0002,117,632stderr
2Jul 8, 2026 13:4634,633177,519,551168,697,0001,006,0002,117,632stderr
3Jul 8, 2026 13:4634,664177,734,402168,848,0001,006,0002,117,632stderr
4Jul 8, 2026 13:4634,694177,863,793168,995,0001,006,0002,117,632stderr
5Jul 8, 2026 13:4634,731178,251,633168,180,0002,003,0002,117,632stderr
6Jul 8, 2026 13:4635,040179,595,446170,692,0001,005,0002,117,632stderr
7Jul 8, 2026 13:4635,179180,482,096171,374,0001,006,0002,117,632stderr
8Jul 8, 2026 13:4635,388181,300,755172,397,0001,007,0002,117,632stderr
9Jul 8, 2026 13:4635,466181,877,781172,781,0001,006,0002,117,632stderr