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 12:48Victor MerckléVictor MerckléScore: 47,421Success
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 12:4847,385240,153,346231,182,0001,006,0002,117,632stderr
2Jul 4, 2026 12:4847,387240,176,466231,191,0001,006,0002,117,632stderr
3Jul 4, 2026 12:4847,388240,215,812230,191,0002,012,0002,117,632stderr
4Jul 4, 2026 12:4847,417240,315,338230,329,0002,018,0002,117,632stderr
5Jul 4, 2026 12:4847,421240,347,369230,350,0002,015,0002,117,632stderr
6Jul 4, 2026 12:4847,471240,647,057230,588,0002,020,0002,117,632stderr
7Jul 4, 2026 12:4847,487240,699,769230,654,0002,037,0002,117,632stderr
8Jul 4, 2026 12:4847,528240,857,520231,884,0001,006,0002,117,632stderr
9Jul 4, 2026 12:4847,620241,352,725231,297,0002,041,0002,117,632stderr