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 19, 2026 18:58Elijah KinElijah KinScore: 2,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 18:581,98415,319,0773,701,0001,259,0002,117,632
2Sep 19, 2026 18:582,05315,237,3543,979,0001,154,0002,117,632
3Sep 19, 2026 18:582,23015,726,2134,312,0001,265,0002,117,632
4Sep 19, 2026 18:582,26315,959,9694,380,0001,278,0002,117,632
5Sep 19, 2026 18:582,27816,622,7824,425,0001,270,0002,117,632
6Sep 19, 2026 18:582,29415,927,5984,466,0001,270,0002,117,632
7Sep 19, 2026 18:582,29716,031,2314,472,0001,272,0002,117,632
8Sep 19, 2026 18:582,32015,983,8964,667,0001,133,0002,117,632
9Sep 19, 2026 18:582,32316,049,3674,676,0001,132,0002,117,632