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 listMar 27, 2026 00:33Jasper EdbrookeJasper EdbrookeScore: 235,119Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 23:03233,0371,166,543,983981,897,000159,983,0002,289,664
2Mar 27, 2026 00:33233,1011,171,404,2481,006,289,000135,904,0002,506,752
3Mar 26, 2026 23:03233,8521,170,736,802999,893,000145,984,0002,289,664
4Mar 26, 2026 23:03235,1191,178,508,5101,031,178,000120,903,0002,281,472
5Mar 27, 2026 00:33235,1521,176,598,5991,013,337,000138,909,0002,289,664
6Mar 27, 2026 00:33237,3901,189,611,0061,033,299,000129,911,0002,502,656