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 15, 2026 22:16Tomislav TunkovicTomislav TunkovicScore: 29,100Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 22:2628,926150,916,800140,733,0001,009,00020,480
2Aug 15, 2026 22:2628,946150,964,777140,828,0001,008,00020,480
3Aug 15, 2026 22:2628,994151,211,920141,065,0001,010,00020,480
4Aug 15, 2026 22:2628,999151,192,317141,091,0001,008,00020,480
5Aug 15, 2026 22:2629,100151,735,220141,584,0001,008,00020,480
6Aug 15, 2026 22:2629,136151,880,276141,763,0001,008,00020,480
7Aug 15, 2026 22:2629,330153,030,420142,711,0001,008,00020,480
8Aug 15, 2026 22:2629,608154,204,743144,073,0001,008,00020,480
9Aug 15, 2026 22:2632,010166,722,766155,839,0001,010,00020,480