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 listNov 2, 2026 21:41Andrew EpsteinAndrew EpsteinScore: 1,389Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2026 21:421,38812,522,7603,472,0000524,288
2Nov 2, 2026 21:421,38812,901,9353,470,0000524,288
3Nov 2, 2026 21:421,38812,880,4443,472,0000524,288
4Nov 2, 2026 21:421,38812,690,8703,470,0000524,288
5Nov 2, 2026 21:421,38912,979,8833,474,0000524,288
6Nov 2, 2026 21:421,39012,887,1433,476,0000524,288
7Nov 2, 2026 21:421,39212,830,6293,480,0000524,288
8Nov 2, 2026 21:421,39712,972,6663,493,0000524,288
9Nov 2, 2026 21:421,39712,932,2013,494,0000524,288