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 3, 2026 18:03Victor MerckléVictor MerckléScore: 48,298Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 18:0348,231244,300,324234,253,0002,082,0002,117,632stderr
2Jul 3, 2026 18:0348,241244,311,414234,371,0002,012,0002,117,632stderr
3Jul 3, 2026 18:0348,250244,413,261234,384,0002,043,0002,117,632stderr
4Jul 3, 2026 18:0348,277244,496,799234,554,0002,008,0002,117,632stderr
5Jul 3, 2026 18:0348,298244,685,686234,644,0002,017,0002,117,632stderr
6Jul 3, 2026 18:0348,307244,650,821234,668,0002,041,0002,117,632stderr
7Jul 3, 2026 18:0348,364244,977,462234,963,0002,025,0002,117,632stderr
8Jul 3, 2026 18:0348,517245,692,913235,699,0002,036,0002,117,632stderr
9Jul 3, 2026 18:0349,325249,811,140239,685,0002,010,0002,117,632stderr