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:26Tomislav TunkovicTomislav TunkovicScore: 29,747Success
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:3028,919150,936,904140,696,0001,010,00020,480
2Aug 15, 2026 22:3028,961151,008,193140,904,0001,008,00020,480
3Aug 15, 2026 22:3029,185152,065,494141,998,0001,012,00020,480
4Aug 15, 2026 22:3029,425153,340,492143,179,0001,008,00020,480
5Aug 15, 2026 22:3029,747154,917,138144,749,0001,012,00020,480
6Aug 15, 2026 22:3029,967155,980,291145,832,0001,011,00020,480
7Aug 15, 2026 22:3030,153156,921,351146,741,0001,010,00020,480
8Aug 15, 2026 22:3030,816161,407,216149,990,0001,009,00020,480
9Aug 15, 2026 22:3041,217211,180,566200,961,0001,005,00020,480