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 2, 2026 15:59Josu San MartinJosu San MartinScore: 30,425Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 16:0030,386159,738,281147,746,0001,146,0002,113,536
2Aug 2, 2026 16:0030,387159,659,803147,777,0001,122,0002,113,536
3Aug 2, 2026 16:0030,398158,891,404147,830,0001,124,0002,113,536
4Aug 2, 2026 16:0030,405159,033,500147,864,0001,124,0002,113,536
5Aug 2, 2026 16:0030,425159,050,694147,978,0001,108,0002,113,536
6Aug 2, 2026 16:0030,430159,125,504147,996,0001,113,0002,113,536
7Aug 2, 2026 16:0030,436160,622,081148,011,0001,130,0002,113,536
8Aug 2, 2026 16:0030,628160,049,000148,967,0001,111,0002,113,536
9Aug 2, 2026 16:0030,673163,728,123149,163,0001,135,0002,113,536