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 4, 2026 14:16Josu San MartinJosu San MartinScore: 25,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 14:1625,262132,189,334122,537,0001,251,0002,113,536
2Aug 4, 2026 14:1625,264132,858,989122,541,0001,253,0002,113,536
3Aug 4, 2026 14:1625,274132,287,103122,587,0001,257,0002,113,536
4Aug 4, 2026 14:1625,282132,326,882122,611,0001,275,0002,113,536
5Aug 4, 2026 14:1625,283132,908,399122,637,0001,250,0002,113,536
6Aug 4, 2026 14:1625,295132,306,142122,685,0001,263,0002,113,536
7Aug 4, 2026 14:1625,329132,534,174122,841,0001,275,0002,113,536
8Aug 4, 2026 14:1625,359133,323,536122,998,0001,262,0002,113,536
9Aug 4, 2026 14:1625,367132,734,945123,252,0001,048,0002,113,536