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 7, 2026 17:37Victor MerckléVictor MerckléScore: 33,671Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 17:3733,387171,395,112157,631,0005,968,00024,576stderr
2Jul 7, 2026 17:3733,573172,332,792158,265,0006,245,00024,576stderr
3Jul 7, 2026 17:3733,649172,700,494158,979,0005,904,00024,576stderr
4Jul 7, 2026 17:3733,661172,791,139158,471,0006,470,00024,576stderr
5Jul 7, 2026 17:3733,671177,033,759158,245,0006,745,00024,576stderr
6Jul 7, 2026 17:3733,731174,825,000158,912,0006,371,00024,576stderr
7Jul 7, 2026 17:3733,734173,288,250159,076,0006,221,00024,576stderr
8Jul 7, 2026 17:3733,797173,406,090159,215,0006,395,00024,576stderr
9Jul 7, 2026 17:3734,270175,811,535161,171,0006,756,00024,576stderr