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 listAug 13, 2026 19:08Tomislav TunkovicTomislav TunkovicScore: 534,058Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 19:09533,6082,623,058,3052,613,681,0001,002,0002,121,728stderr
2Aug 13, 2026 19:09533,7322,623,625,4712,614,288,0001,001,0002,121,728stderr
3Aug 13, 2026 19:09533,8302,624,439,6942,614,760,0001,011,0002,121,728stderr
4Aug 13, 2026 19:09533,9302,624,851,8852,615,258,0001,003,0002,121,728stderr
5Aug 13, 2026 19:09534,0582,625,484,1862,615,887,0001,001,0002,121,728stderr
6Aug 13, 2026 19:09534,2182,625,992,0492,616,660,0001,010,0002,121,728stderr
7Aug 13, 2026 19:09534,4072,626,886,6012,617,596,0001,002,0002,121,728stderr
8Aug 13, 2026 19:09535,3012,631,597,1242,621,973,0001,003,0002,121,728stderr
9Aug 13, 2026 19:09547,0312,689,730,6332,679,444,0001,009,0002,121,728stderr