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 19:48Josu San MartinJosu San MartinScore: 27,384Success
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 19:4927,281142,178,944132,676,0001,004,0002,113,536
2Aug 3, 2026 19:4927,347142,526,257132,969,0001,033,0002,113,536
3Aug 3, 2026 19:4927,351142,471,166132,749,0001,272,0002,113,536
4Aug 3, 2026 19:4927,371142,492,366132,842,0001,279,0002,113,536
5Aug 3, 2026 19:4927,384142,432,637132,912,0001,270,0002,113,536
6Aug 3, 2026 19:4927,386143,864,588133,008,0001,186,0002,113,536
7Aug 3, 2026 19:4927,404142,758,800133,017,0001,263,0002,113,536
8Aug 3, 2026 19:4927,572143,613,618133,844,0001,262,0002,113,536
9Aug 3, 2026 19:4928,180146,290,671137,066,0001,018,0002,113,536