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 02:20Josu San MartinJosu San MartinScore: 29,253Success
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 02:2129,236151,658,392142,001,0001,256,0002,113,536
2Aug 3, 2026 02:2129,245151,717,021142,031,0001,273,0002,113,536
3Aug 3, 2026 02:2129,248151,784,645142,057,0001,262,0002,113,536
4Aug 3, 2026 02:2129,249151,727,441142,062,0001,261,0002,113,536
5Aug 3, 2026 02:2129,253151,724,734142,080,0001,264,0002,113,536
6Aug 3, 2026 02:2129,260152,380,997142,119,0001,259,0002,113,536
7Aug 3, 2026 02:2129,295151,997,545142,274,0001,275,0002,113,536
8Aug 3, 2026 02:2129,321151,849,460142,653,0001,022,0002,113,536
9Aug 3, 2026 02:2129,334151,934,149142,622,0001,118,0002,113,536