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 listSep 3, 2026 18:23Victor MerckléVictor MerckléScore: 26,171Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 18:2426,144136,564,042127,094,0001,016,0002,117,632stderr
2Sep 3, 2026 18:2426,148136,564,625127,100,0001,029,0002,117,632stderr
3Sep 3, 2026 18:2426,167136,646,069127,137,0001,086,0002,117,632stderr
4Sep 3, 2026 18:2426,170136,651,618127,116,0001,120,0002,117,632stderr
5Sep 3, 2026 18:2426,171136,715,183127,151,0001,087,0002,117,632stderr
6Sep 3, 2026 18:2426,176136,671,400127,165,0001,101,0002,117,632stderr
7Sep 3, 2026 18:2426,176136,741,776127,175,0001,088,0002,117,632stderr
8Sep 3, 2026 18:2426,180138,065,806127,188,0001,097,0002,117,632stderr
9Sep 3, 2026 18:2426,183136,739,239127,192,0001,107,0002,117,632stderr