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 9, 2026 22:26Victor MerckléVictor MerckléScore: 31,045Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 22:2730,855159,666,565149,161,0002,031,0002,117,632stderr
2Jul 9, 2026 22:2730,950159,834,338150,649,0001,010,0002,117,632stderr
3Jul 9, 2026 22:2730,972159,828,357150,758,0001,008,0002,117,632stderr
4Jul 9, 2026 22:2731,029160,178,241150,021,0002,022,0002,117,632stderr
5Jul 9, 2026 22:2731,045160,259,047151,116,0001,009,0002,117,632stderr
6Jul 9, 2026 22:2731,054160,043,092151,158,0001,010,0002,117,632stderr
7Jul 9, 2026 22:2731,057160,352,369151,177,0001,007,0002,117,632stderr
8Jul 9, 2026 22:2731,092160,856,141151,344,0001,008,0002,117,632stderr
9Jul 9, 2026 22:2731,103160,504,428151,395,0001,010,0002,117,632stderr