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 6, 2026 13:31Victor MerckléVictor MerckléScore: 36,139Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 13:3435,928184,210,168174,035,0002,013,0002,117,632stderr
2Jul 6, 2026 13:3435,959184,182,192175,194,0001,006,0002,117,632stderr
3Jul 6, 2026 13:3436,035184,544,198175,568,0001,007,0002,117,632stderr
4Jul 6, 2026 13:3436,039184,715,000175,587,0001,006,0002,117,632stderr
5Jul 6, 2026 13:3436,139185,050,856175,074,0002,010,0002,117,632stderr
6Jul 6, 2026 13:3436,159185,157,819175,165,0002,017,0002,117,632stderr
7Jul 6, 2026 13:3436,182185,287,797175,286,0002,009,0002,117,632stderr
8Jul 6, 2026 13:3436,241185,527,371176,578,0001,007,0002,117,632stderr
9Jul 6, 2026 13:3436,652187,574,098178,592,0001,006,0002,117,632stderr