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 1, 2026 00:22Victor MerckléVictor MerckléScore: 59,068Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 00:2358,966296,683,159286,886,0002,051,0002,117,632stderr
2Jul 1, 2026 00:2358,966296,814,311286,882,0002,055,0002,117,632stderr
3Jul 1, 2026 00:2359,014297,042,956287,105,0002,067,0002,117,632stderr
4Jul 1, 2026 00:2359,025297,009,467287,165,0002,061,0002,117,632stderr
5Jul 1, 2026 00:2359,068297,088,090287,321,0002,116,0002,117,632stderr
6Jul 1, 2026 00:2359,100297,428,810287,520,0002,072,0002,117,632stderr
7Jul 1, 2026 00:2359,125297,414,314287,530,0002,183,0002,117,632stderr
8Jul 1, 2026 00:2359,128297,622,611287,716,0002,015,0002,117,632stderr
9Jul 1, 2026 00:2360,254303,227,291293,149,0002,098,0002,117,632stderr