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 21:47Elijah KinElijah KinScore: 2,575Success
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 21:482,39214,998,6044,875,0001,107,0002,117,632
2Jun 5, 2026 21:482,42815,407,7214,945,0001,125,0002,117,632
3Jun 5, 2026 21:482,50623,148,7335,160,0001,107,0002,117,632
4Jun 5, 2026 21:482,56715,460,9325,308,0001,110,0002,117,632
5Jun 5, 2026 21:482,57515,455,9785,344,0001,095,0002,117,632
6Jun 5, 2026 21:482,58415,491,3545,360,0001,100,0002,117,632
7Jun 5, 2026 21:482,60916,127,7815,419,0001,105,0002,117,632
8Jun 5, 2026 21:482,65915,751,4115,535,0001,113,0002,117,632
9Jun 5, 2026 21:482,69016,204,8275,614,0001,112,0002,117,632