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 14:31Josu San MartinJosu San MartinScore: 30,758Success
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 14:3230,561159,899,997148,632,0001,119,0002,113,536
2Aug 2, 2026 14:3230,579159,918,339148,717,0001,124,0002,113,536
3Aug 2, 2026 14:3230,742160,650,801149,517,0001,119,0002,113,536
4Aug 2, 2026 14:3230,752160,739,404149,562,0001,125,0002,113,536
5Aug 2, 2026 14:3230,758162,707,303149,580,0001,137,0002,113,536
6Aug 2, 2026 14:3230,795161,027,287149,773,0001,123,0002,113,536
7Aug 2, 2026 14:3230,812161,140,354149,844,0001,139,0002,113,536
8Aug 2, 2026 14:3230,842161,210,338150,007,0001,122,0002,113,536
9Aug 2, 2026 14:3231,004162,206,992150,806,0001,118,0002,113,536