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 00:38Victor MerckléVictor MerckléScore: 49,288Success
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 00:3948,951247,864,336237,856,0002,004,0002,117,632stderr
2Jul 4, 2026 00:3948,959247,883,225237,892,0002,010,0002,117,632stderr
3Jul 4, 2026 00:3949,181248,901,620239,983,0001,007,0002,117,632stderr
4Jul 4, 2026 00:3949,281249,447,802239,475,0002,005,0002,117,632stderr
5Jul 4, 2026 00:3949,288249,452,438239,500,0002,016,0002,117,632stderr
6Jul 4, 2026 00:3949,334249,735,036239,718,0002,020,0002,117,632stderr
7Jul 4, 2026 00:3949,376249,878,901239,933,0002,012,0002,117,632stderr
8Jul 4, 2026 00:3949,389249,965,768239,981,0002,028,0002,117,632stderr
9Jul 4, 2026 00:3949,437250,188,511240,222,0002,024,0002,117,632stderr