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 3, 2026 18:58Victor MerckléVictor MerckléScore: 51,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 18:5951,307259,828,301249,361,0002,048,0002,117,632stderr
2Jul 3, 2026 18:5951,310259,366,049249,328,0002,092,0002,117,632stderr
3Jul 3, 2026 18:5951,312259,342,790249,333,0002,097,0002,117,632stderr
4Jul 3, 2026 18:5951,328259,502,438249,428,0002,083,0002,117,632stderr
5Jul 3, 2026 18:5951,397260,168,596249,840,0002,010,0002,117,632stderr
6Jul 3, 2026 18:5951,400260,304,447249,832,0002,031,0002,117,632stderr
7Jul 3, 2026 18:5951,538260,457,245250,514,0002,027,0002,117,632stderr
8Jul 3, 2026 18:5951,592260,765,363250,707,0002,097,0002,117,632stderr
9Jul 3, 2026 18:5952,621266,190,965255,837,0002,009,0002,117,632stderr