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 listMay 29, 2026 05:19Elijah KinElijah KinScore: 5,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 05:204,97322,706,0468,960,0003,473,0002,117,632
2May 29, 2026 05:204,98023,724,3108,973,0003,478,0002,113,536
3May 29, 2026 05:205,00722,005,3559,003,0003,515,0002,113,536
4May 29, 2026 05:205,03622,198,3639,032,0003,558,0002,113,536
5May 29, 2026 05:205,12722,930,7659,174,0003,644,0002,117,632
6May 29, 2026 05:205,19122,042,0649,452,0003,526,0002,113,536
7May 29, 2026 05:205,45323,711,33310,174,0003,460,0002,113,536
8May 29, 2026 05:205,56023,241,13910,360,0003,541,0002,113,536
9May 29, 2026 05:205,59823,279,91610,512,0003,483,0002,113,536