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:31Andrew EpsteinAndrew EpsteinScore: 1,920Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 12:27Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 04:321,85914,473,6203,517,0001,132,0002,117,632
2Aug 23, 2026 04:321,87314,407,5163,538,0001,146,0002,117,632
3Aug 23, 2026 04:321,88114,440,3873,566,0001,138,0002,117,632
4Aug 23, 2026 04:321,88314,348,2283,584,0001,124,0002,117,632
5Aug 23, 2026 04:321,92016,023,0103,584,0001,218,0002,117,632
6Aug 23, 2026 04:321,92214,550,0073,577,0001,230,0002,117,632
7Aug 23, 2026 04:321,92314,587,1463,582,0001,227,0002,117,632
8Aug 23, 2026 04:321,92514,609,2913,593,0001,220,0002,117,632
9Aug 23, 2026 04:321,93114,598,0633,587,0001,241,0002,117,632