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 listSep 14, 2026 15:10Victor MerckléVictor MerckléScore: 1,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 15:101,45412,426,2252,584,0001,052,0002,117,632stderr
2Sep 14, 2026 15:101,48212,409,2102,624,0001,083,0002,117,632stderr
3Sep 14, 2026 15:101,49012,286,3032,624,0001,101,0002,117,632stderr
4Sep 14, 2026 15:101,49312,471,9342,647,0001,087,0002,117,632stderr
5Sep 14, 2026 15:101,49512,399,3152,639,0001,100,0002,117,632stderr
6Sep 14, 2026 15:101,51112,591,5632,675,0001,104,0002,117,632stderr
7Sep 14, 2026 15:101,51512,470,5202,627,0001,162,0002,117,632stderr
8Sep 14, 2026 15:101,53713,341,7302,725,0001,118,0002,117,632stderr
9Sep 14, 2026 15:101,57812,452,9642,795,0001,151,0002,117,632stderr