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:32Josu San MartinJosu San MartinScore: 25,291Success
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:3325,263132,192,289122,530,0001,259,0002,113,536
2Aug 4, 2026 14:3325,273132,353,775122,582,0001,260,0002,113,536
3Aug 4, 2026 14:3325,281132,372,910122,630,0001,251,0002,113,536
4Aug 4, 2026 14:3325,285132,356,227122,624,0001,273,0002,113,536
5Aug 4, 2026 14:3325,291132,454,045122,920,0001,007,0002,113,536
6Aug 4, 2026 14:3325,347132,632,435123,196,0001,008,0002,113,536
7Aug 4, 2026 14:3325,354132,532,928123,228,0001,008,0002,113,536
8Aug 4, 2026 14:3325,361132,835,439123,202,0001,070,0002,113,536
9Aug 4, 2026 14:3325,585133,623,522124,111,0001,259,0002,113,536