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 29, 2026 15:54Victor MerckléVictor MerckléScore: 1,525Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 03:38Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 15:551,49512,217,7272,682,0001,056,0002,117,632stderr
2Aug 29, 2026 15:551,50612,204,5222,703,0001,062,0002,117,632stderr
3Aug 29, 2026 15:551,52012,150,4932,733,0001,068,0002,117,632stderr
4Aug 29, 2026 15:551,52313,106,9522,738,0001,071,0002,117,632stderr
5Aug 29, 2026 15:551,52512,078,8842,731,0001,083,0002,117,632stderr
6Aug 29, 2026 15:551,52712,195,6582,741,0001,078,0002,117,632stderr
7Aug 29, 2026 15:551,53012,160,3742,748,0001,077,0002,117,632stderr
8Aug 29, 2026 15:551,53312,003,7382,726,0001,108,0002,117,632stderr
9Aug 29, 2026 15:551,59812,288,5082,767,0001,230,0002,117,632stderr