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:09Elijah KinElijah KinScore: 2,554Success
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:102,48415,258,1515,078,0001,132,0002,117,632
2Jun 5, 2026 19:102,51515,312,8995,153,0001,135,0002,117,632
3Jun 5, 2026 19:102,51915,394,5195,154,0001,144,0002,117,632
4Jun 5, 2026 19:102,53415,357,8115,189,0001,147,0002,117,632
5Jun 5, 2026 19:102,55415,382,3855,234,0001,151,0002,117,632
6Jun 5, 2026 19:102,64516,083,1105,419,0001,195,0002,117,632
7Jun 5, 2026 19:102,66615,952,8895,478,0001,187,0002,117,632
8Jun 5, 2026 19:102,70816,215,4775,595,0001,175,0002,117,632
9Jun 5, 2026 19:102,73316,337,4655,650,0001,184,0002,117,632