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 3, 2026 20:08anboto1anboto1Score: 58,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 20:0858,525295,220,464285,674,0001,101,0002,113,536
2Aug 3, 2026 20:0858,546295,293,564285,788,0001,090,0002,113,536
3Aug 3, 2026 20:0858,552300,643,341285,789,0001,120,0002,113,536
4Aug 3, 2026 20:0858,573296,157,714285,918,0001,094,0002,113,536
5Aug 3, 2026 20:0858,657297,221,964286,338,0001,085,0002,113,536
6Aug 3, 2026 20:0858,713296,766,817286,534,0001,160,0002,113,536
7Aug 3, 2026 20:0859,018297,633,780288,090,0001,101,0002,113,536
8Aug 3, 2026 20:0859,627305,917,463291,019,0001,155,0002,113,536
9Aug 3, 2026 20:0860,030302,656,811292,998,0001,152,0002,113,536