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 21, 2026 18:45Jacob McDanielJacob McDanielScore: 2,526Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:452,44515,978,7444,906,0001,207,0002,117,632
2May 21, 2026 18:452,44615,392,1724,915,0001,201,0002,117,632
3May 21, 2026 18:452,46317,058,9624,942,0001,217,0002,117,632
4May 21, 2026 18:452,46316,592,5724,940,0001,219,0002,117,632
5May 21, 2026 18:452,52615,909,9815,049,0001,266,0002,117,632
6May 21, 2026 18:452,53617,219,8445,089,0001,253,0002,117,632
7May 21, 2026 18:452,57217,174,6795,147,0001,285,0002,117,632
8May 21, 2026 18:452,61817,506,0525,290,0001,256,0002,117,632
9May 21, 2026 18:452,64816,615,2375,327,0001,295,0002,117,632