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 21:29Victor MerckléVictor MerckléScore: 1,501Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 21:301,46912,153,5492,610,0001,064,0002,117,632stderr
2Aug 30, 2026 21:301,47811,937,6852,618,0001,079,0002,117,632stderr
3Aug 30, 2026 21:301,47911,989,5972,615,0001,084,0002,117,632stderr
4Aug 30, 2026 21:301,48311,962,4342,622,0001,087,0002,117,632stderr
5Aug 30, 2026 21:301,50112,131,1152,644,0001,109,0002,117,632stderr
6Aug 30, 2026 21:301,52012,220,8112,692,0001,110,0002,117,632stderr
7Aug 30, 2026 21:301,52112,217,0252,616,0001,188,0002,117,632stderr
8Aug 30, 2026 21:301,54612,064,4602,723,0001,142,0002,117,632stderr
9Aug 30, 2026 21:301,58312,281,8752,837,0001,121,0002,117,632stderr