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 30, 2026 20:16Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 01:19Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 02:57013,198,0702,915,0001,152,0002,117,632pos 30: expected 0 got 255stderr
2Sep 5, 2026 02:57013,223,2082,918,0001,131,0002,117,632pos 34: expected 162 got 161stderr
3Sep 5, 2026 02:57013,108,0302,850,0001,139,0002,117,632pos 34: expected 100 got 99stderr
4Aug 30, 2026 20:171,47712,222,3072,605,0001,089,0002,117,632stderr
5Aug 30, 2026 20:171,48112,120,5292,623,0001,081,0002,117,632stderr
6Aug 30, 2026 20:171,48212,091,2722,619,0001,088,0002,117,632stderr
7Aug 30, 2026 20:171,48412,857,6982,620,0001,092,0002,117,632stderr
8Aug 30, 2026 20:171,48612,126,9282,624,0001,091,0002,117,632stderr
9Aug 30, 2026 20:171,49112,137,3062,633,0001,096,0002,117,632stderr
10Aug 30, 2026 20:171,49612,083,4212,651,0001,090,0002,117,632stderr
11Aug 30, 2026 20:171,49812,149,1782,638,0001,107,0002,117,632stderr
12Aug 30, 2026 20:171,49812,167,5212,647,0001,100,0002,117,632stderr