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 4, 2026 04:11Victor MerckléVictor MerckléScore: 51,249Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 04:1251,091258,266,021248,331,0002,018,0002,117,632stderr
2Jul 4, 2026 04:1251,188258,762,966248,778,0002,047,0002,117,632stderr
3Jul 4, 2026 04:1251,202259,516,113248,867,0002,026,0002,117,632stderr
4Jul 4, 2026 04:1251,216258,810,575248,855,0002,108,0002,117,632stderr
5Jul 4, 2026 04:1251,249259,123,607249,080,0002,043,0002,117,632stderr
6Jul 4, 2026 04:1251,289259,327,342249,153,0002,167,0002,117,632stderr
7Jul 4, 2026 04:1251,321259,466,754249,368,0002,105,0002,117,632stderr
8Jul 4, 2026 04:1251,631260,916,049250,957,0002,037,0002,117,632stderr
9Jul 4, 2026 04:1251,918262,137,263252,224,0002,179,0002,117,632stderr