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 26, 2026 00:36Jasper EdbrookeJasper EdbrookeScore: 1,390,204Success
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 00:361,362,45713,219,303,9794,351,081,0002,324,959,000180,224
2Mar 26, 2026 00:361,370,72814,766,634,6954,357,481,0002,359,088,000180,224
3Mar 26, 2026 00:361,370,85913,516,981,7304,203,350,0002,513,858,000180,224
4Mar 26, 2026 00:361,389,01813,700,470,8554,464,013,0002,342,173,000233,472
5Mar 26, 2026 00:361,390,20414,841,170,1884,427,702,0002,384,299,000180,224
6Mar 26, 2026 00:361,392,48213,860,315,4234,453,334,0002,369,827,000180,224
7Mar 26, 2026 00:361,395,83413,722,291,3214,392,173,0002,447,415,000237,568
8Mar 26, 2026 00:361,398,88913,861,809,3374,487,596,0002,366,961,000180,224
9Mar 26, 2026 00:361,401,23913,903,961,6704,475,950,0002,390,119,000180,224