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 5, 2026 17:50Victor MerckléVictor MerckléScore: 52,223Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 17:5152,031262,710,601250,055,0004,899,00024,576stderr
2Jul 5, 2026 17:5152,089263,321,692250,248,0004,989,00024,576stderr
3Jul 5, 2026 17:5152,132263,422,125250,367,0005,080,00024,576stderr
4Jul 5, 2026 17:5152,136263,518,902250,279,0005,190,00024,576stderr
5Jul 5, 2026 17:5152,223263,823,066250,597,0005,296,0002,117,632stderr
6Jul 5, 2026 17:5152,447265,060,989251,794,0005,200,0002,117,632stderr
7Jul 5, 2026 17:5152,518265,330,503252,228,0005,114,0002,117,632stderr
8Jul 5, 2026 17:5153,435269,824,691256,798,0005,034,00024,576stderr
9Jul 5, 2026 17:5153,563270,508,251257,450,0005,012,00024,576stderr