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 16:14Victor MerckléVictor MerckléScore: 33,587Success
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 16:1533,351171,504,748161,392,0002,031,0002,117,632stderr
2Jul 7, 2026 16:1533,429171,653,609161,707,0002,096,0002,117,632stderr
3Jul 7, 2026 16:1533,455171,897,682161,898,0002,036,0002,117,632stderr
4Jul 7, 2026 16:1533,500171,944,205162,139,0002,013,0002,117,632stderr
5Jul 7, 2026 16:1533,587172,425,156163,573,0001,008,0002,117,632stderr
6Jul 7, 2026 16:1533,619172,786,606162,647,0002,087,0002,117,632stderr
7Jul 7, 2026 16:1533,632172,928,044162,702,0002,098,0002,117,632stderr
8Jul 7, 2026 16:1533,742173,441,080164,332,0001,007,0002,117,632stderr
9Jul 7, 2026 16:1533,836175,175,455164,793,0001,006,0002,117,632stderr