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 7, 2026 16:03Victor MerckléVictor MerckléScore: 32,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 16:0332,545167,558,547158,461,0001,012,0002,117,632stderr
2Jul 7, 2026 16:0332,551167,324,520158,492,0001,010,0002,117,632stderr
3Jul 7, 2026 16:0332,806168,622,399159,747,0001,007,0002,117,632stderr
4Jul 7, 2026 16:0332,855168,828,837159,983,0001,010,0002,117,632stderr
5Jul 7, 2026 16:0332,860168,823,312160,005,0001,011,0002,117,632stderr
6Jul 7, 2026 16:0332,861169,079,961160,014,0001,007,0002,117,632stderr
7Jul 7, 2026 16:0332,888169,435,196160,146,0001,007,0002,117,632stderr
8Jul 7, 2026 16:0332,888168,960,836160,150,0001,006,0002,117,632stderr
9Jul 7, 2026 16:0333,060169,806,922160,989,0001,006,0002,117,632stderr