Large integer multiplication Bernard Teo

Multiply two large unsigned integers as fast as possible.

Input

Exactly 500,000 bytes on STDIN: two unsigned integers encoded back-to-back, each 250,000 bytes, in little-endian byte order.

Output

Write exactly 500,000 bytes to STDOUT containing the product in little-endian byte order.

Back to listAug 23, 2026 04:00Andrew EpsteinAndrew EpsteinScore: 1,930Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 12:27Tomislav Tunkovic10.00CustomSolution Held
Sep 4, 2026 11:25Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 04:001,90721,298,9793,589,0001,179,0002,121,728
2Aug 23, 2026 04:001,92414,649,7393,624,0001,187,0002,121,728
3Aug 23, 2026 04:001,92614,955,6213,637,0001,179,0002,121,728
4Aug 23, 2026 04:001,92614,692,2373,614,0001,203,0002,121,728
5Aug 23, 2026 04:001,93014,774,1943,629,0001,198,0002,121,728
6Aug 23, 2026 04:001,93214,676,0243,644,0001,188,0002,121,728
7Aug 23, 2026 04:001,94014,684,0993,650,0001,200,0002,121,728
8Aug 23, 2026 04:001,96815,797,2533,650,0001,271,0002,121,728
9Aug 23, 2026 04:001,96814,823,9733,653,0001,268,0002,121,728