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 8, 2026 14:01Victor MerckléVictor MerckléScore: 52,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 14:0152,710266,325,150257,275,0001,007,0002,117,632stderr
2Jul 8, 2026 14:0152,742266,493,383256,359,0002,081,0002,117,632stderr
3Jul 8, 2026 14:0152,928267,246,866257,242,0002,107,0002,117,632stderr
4Jul 8, 2026 14:0152,934267,442,394257,240,0002,137,0002,117,632stderr
5Jul 8, 2026 14:0152,970268,883,999257,547,0002,010,0002,117,632stderr
6Jul 8, 2026 14:0153,029267,975,302257,808,0002,037,0002,117,632stderr
7Jul 8, 2026 14:0154,263274,009,930263,873,0002,020,0002,117,632stderr
8Jul 8, 2026 14:0154,355274,398,409264,334,0002,010,0002,117,632stderr
9Jul 8, 2026 14:0155,862281,900,294271,515,0002,212,0002,117,632stderr