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 07:30Josu San MartinJosu San MartinScore: 30,712Success
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 07:3030,704158,890,616149,201,0001,252,0002,113,536
2Aug 3, 2026 07:3030,705158,914,026149,185,0001,273,0002,113,536
3Aug 3, 2026 07:3030,708158,945,746149,197,0001,274,0002,113,536
4Aug 3, 2026 07:3030,711158,903,883149,462,0001,025,0002,113,536
5Aug 3, 2026 07:3030,712158,973,297149,214,0001,277,0002,113,536
6Aug 3, 2026 07:3030,714159,560,197149,250,0001,250,0002,113,536
7Aug 3, 2026 07:3030,716158,992,636149,239,0001,271,0002,113,536
8Aug 3, 2026 07:3030,739159,042,255149,582,0001,043,0002,113,536
9Aug 3, 2026 07:3030,938159,981,511150,321,0001,276,0002,113,536