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 21:37anboto1anboto1Score: 57,601Success
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 21:3857,550290,467,866280,906,0001,090,0002,113,536
2Aug 3, 2026 21:3857,558291,154,982280,862,0001,175,0002,113,536
3Aug 3, 2026 21:3857,576291,262,831281,016,0001,108,0002,113,536
4Aug 3, 2026 21:3857,578290,654,916280,988,0001,146,0002,113,536
5Aug 3, 2026 21:3857,601291,348,537281,236,0001,011,0002,113,536
6Aug 3, 2026 21:3857,646291,481,385281,307,0001,160,0002,113,536
7Aug 3, 2026 21:3857,650291,035,030281,438,0001,051,0002,113,536
8Aug 3, 2026 21:3857,693291,771,392281,592,0001,105,0002,113,536
9Aug 3, 2026 21:3858,062292,916,749283,411,0001,093,0002,113,536