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 14:24Victor MerckléVictor MerckléScore: 47,755Success
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 14:2547,554241,018,320231,001,0002,016,0002,117,632stderr
2Jul 4, 2026 14:2547,572241,036,748231,088,0002,019,0002,117,632stderr
3Jul 4, 2026 14:2547,695241,716,478231,655,0002,054,0002,117,632stderr
4Jul 4, 2026 14:2547,699242,102,500231,682,0002,047,0002,117,632stderr
5Jul 4, 2026 14:2547,755242,035,830231,880,0002,123,0002,117,632stderr
6Jul 4, 2026 14:2547,756241,963,657231,959,0002,048,0002,117,632stderr
7Jul 4, 2026 14:2548,133245,192,094233,790,0002,066,0002,117,632stderr
8Jul 4, 2026 14:2548,216244,279,232234,238,0002,022,0002,117,632stderr
9Jul 4, 2026 14:2548,307244,655,136234,649,0002,057,0002,117,632stderr