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 listJun 5, 2026 19:36Elijah KinElijah KinScore: 2,694Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 19:382,50415,342,0355,153,0001,109,0002,117,632
2Jun 5, 2026 19:382,52115,330,9085,183,0001,121,0002,117,632
3Jun 5, 2026 19:382,54015,397,4205,211,0001,141,0002,117,632
4Jun 5, 2026 19:382,61615,606,8135,401,0001,140,0002,117,632
5Jun 5, 2026 19:382,69415,711,5695,582,0001,154,0002,117,632
6Jun 5, 2026 19:382,69716,208,3445,593,0001,151,0002,117,632
7Jun 5, 2026 19:382,70515,790,8605,638,0001,126,0002,117,632
8Jun 5, 2026 19:382,73816,362,5685,681,0001,164,0002,117,632
9Jun 5, 2026 19:382,78116,369,4095,783,0001,170,0002,117,632