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 1, 2026 11:56Victor MerckléVictor MerckléScore: 49,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 11:5649,340249,622,625239,763,0002,005,0002,117,632stderr
2Jul 1, 2026 11:5649,345249,675,028239,771,0002,022,0002,117,632stderr
3Jul 1, 2026 11:5649,353249,562,086239,818,0002,012,0002,117,632stderr
4Jul 1, 2026 11:5649,368249,869,815239,902,0002,006,0002,117,632stderr
5Jul 1, 2026 11:5649,370249,829,468240,910,0001,007,0002,117,632stderr
6Jul 1, 2026 11:5649,395249,757,112240,025,0002,014,0002,117,632stderr
7Jul 1, 2026 11:5649,415250,078,078240,099,0002,038,0002,117,632stderr
8Jul 1, 2026 11:5649,488250,385,922240,467,0002,029,0002,117,632stderr
9Jul 1, 2026 11:5649,546250,661,561241,771,0001,006,0002,117,632stderr