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 10:25Victor MerckléVictor MerckléScore: 1,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 10:301,57312,351,7732,845,0001,089,0002,117,632stderr
2Aug 29, 2026 10:301,59012,317,3392,864,0001,113,0002,117,632stderr
3Aug 29, 2026 10:301,59412,367,5672,879,0001,106,0002,117,632stderr
4Aug 29, 2026 10:301,59512,292,9782,887,0001,101,0002,117,632stderr
5Aug 29, 2026 10:301,66412,556,9303,011,0001,151,0002,117,632stderr
6Aug 29, 2026 10:301,69012,595,8713,082,0001,144,0002,117,632stderr
7Aug 29, 2026 10:301,69412,656,6863,093,0001,144,0002,117,632stderr
8Aug 29, 2026 10:301,69812,573,4173,092,0001,154,0002,117,632stderr
9Aug 29, 2026 10:301,72012,765,1423,198,0001,104,0002,117,632stderr