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 10, 2026 00:19Victor MerckléVictor MerckléScore: 29,247Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 00:2029,035150,072,824140,259,0002,017,0002,117,632stderr
2Jul 10, 2026 00:2029,082150,622,644141,493,0001,011,0002,117,632stderr
3Jul 10, 2026 00:2029,182151,142,039140,990,0002,006,0002,117,632stderr
4Jul 10, 2026 00:2029,194151,180,186141,035,0002,019,0002,117,632stderr
5Jul 10, 2026 00:2029,247151,460,107141,228,0002,086,0002,117,632stderr
6Jul 10, 2026 00:2029,248151,146,421141,309,0002,011,0002,117,632stderr
7Jul 10, 2026 00:2029,283151,425,679141,457,0002,031,0002,117,632stderr
8Jul 10, 2026 00:2029,327151,796,976141,670,0002,037,0002,117,632stderr
9Jul 10, 2026 00:2029,614153,183,502144,104,0001,009,0002,117,632stderr