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 12:51Victor MerckléVictor MerckléScore: 52,219Success
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 12:5252,185264,013,393253,675,0002,034,0002,117,632stderr
2Jul 1, 2026 12:5252,189264,058,261253,717,0002,010,0002,117,632stderr
3Jul 1, 2026 12:5252,194264,898,220253,711,0002,043,0002,117,632stderr
4Jul 1, 2026 12:5252,199263,687,118253,735,0002,042,0002,117,632stderr
5Jul 1, 2026 12:5252,219263,805,665253,840,0002,034,0002,117,632stderr
6Jul 1, 2026 12:5252,244263,986,553253,995,0002,004,0002,117,632stderr
7Jul 1, 2026 12:5252,245263,901,948253,980,0002,024,0002,117,632stderr
8Jul 1, 2026 12:5252,257264,423,920253,951,0002,113,0002,117,632stderr
9Jul 1, 2026 12:5252,300264,192,665254,262,0002,011,0002,117,632stderr