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 24, 2026 18:18Jasper EdbrookeJasper EdbrookeScore: 2,806,733Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 18:182,802,06013,763,734,80513,582,170,000147,925,0002,281,472
2Mar 24, 2026 18:182,802,38313,766,402,83213,598,746,000132,929,0002,281,472
3Mar 24, 2026 18:182,802,92913,764,909,72013,603,414,000130,936,0002,281,472
4Mar 24, 2026 18:182,805,11513,776,962,84813,624,116,000120,947,0002,281,472
5Mar 24, 2026 18:182,806,73313,786,481,80013,622,060,000130,933,0002,281,472
6Mar 24, 2026 18:182,811,28913,808,282,46913,645,378,000129,936,0002,281,472
7Mar 24, 2026 18:182,814,94713,825,411,83413,666,305,000126,937,0002,281,472
8Mar 24, 2026 18:182,846,49713,980,899,16313,821,910,000125,926,0002,281,472
9Mar 24, 2026 18:182,862,45014,059,446,95513,882,076,000143,928,0002,281,472