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 listMay 20, 2026 14:14Victor MerckléVictor MerckléScore: 2,845Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 14:152,71915,360,5275,461,0001,338,0002,113,536
2May 20, 2026 14:152,72415,476,6335,472,0001,340,0002,113,536
3May 20, 2026 14:152,72915,324,5055,484,0001,340,0002,113,536
4May 20, 2026 14:152,74415,568,4925,509,0001,353,0002,113,536
5May 20, 2026 14:152,84515,024,7555,778,0001,335,0002,113,536
6May 20, 2026 14:152,84914,844,0045,787,0001,336,0002,113,536
7May 20, 2026 14:152,85216,118,5775,794,0001,336,0002,113,536
8May 20, 2026 14:152,88615,440,4365,864,0001,351,0002,113,536
9May 20, 2026 14:152,90715,084,7794,934,0002,334,0002,113,536