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 05:08Victor MerckléVictor MerckléScore: 48,744Success
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 05:0948,500245,638,578235,634,0002,017,0002,117,632stderr
2Jul 5, 2026 05:0948,520245,741,803235,740,0002,010,0002,117,632stderr
3Jul 5, 2026 05:0948,717246,711,088236,638,0002,077,0002,117,632stderr
4Jul 5, 2026 05:0948,730246,868,917236,666,0002,112,0002,117,632stderr
5Jul 5, 2026 05:0948,744246,809,986236,822,0002,024,0002,117,632stderr
6Jul 5, 2026 05:0948,762247,020,243236,885,0002,050,0002,117,632stderr
7Jul 5, 2026 05:0948,859248,559,545237,367,0002,044,0002,117,632stderr
8Jul 5, 2026 05:0948,880247,996,060237,422,0002,092,0002,117,632stderr
9Jul 5, 2026 05:0949,480250,393,745240,434,0002,021,0002,117,632stderr