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 9, 2026 22:10Victor MerckléVictor MerckléScore: 31,225Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 22:1131,127160,399,432151,519,0001,008,0002,117,632stderr
2Jul 9, 2026 22:1131,156160,602,735151,657,0001,011,0002,117,632stderr
3Jul 9, 2026 22:1131,186160,703,150151,804,0001,010,0002,117,632stderr
4Jul 9, 2026 22:1131,223160,993,165151,986,0001,009,0002,117,632stderr
5Jul 9, 2026 22:1131,225161,054,749151,998,0001,009,0002,117,632stderr
6Jul 9, 2026 22:1131,268161,284,936152,209,0001,008,0002,117,632stderr
7Jul 9, 2026 22:1131,316161,533,058151,424,0002,025,0002,117,632stderr
8Jul 9, 2026 22:1131,344161,427,757152,580,0001,009,0002,117,632stderr
9Jul 9, 2026 22:1131,393162,048,773151,813,0002,013,0002,117,632stderr