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 20, 2026 16:50M-RochatM-RochatScore: 4,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 16:514,54420,715,58510,272,0001,088,0002,121,728
2May 20, 2026 16:514,55120,792,99410,290,0001,088,0002,117,632
3May 20, 2026 16:514,55620,734,91010,303,0001,089,0002,121,728
4May 20, 2026 16:514,68521,433,13210,615,0001,099,0002,117,632
5May 20, 2026 16:514,69021,577,64310,627,0001,100,0002,117,632
6May 20, 2026 16:514,70021,204,16510,653,0001,097,0002,121,728
7May 20, 2026 16:514,70721,762,64910,668,0001,101,0002,117,632
8May 20, 2026 16:514,70921,133,29210,676,0001,098,0002,117,632
9May 20, 2026 16:514,71921,115,3389,763,0002,035,0002,117,632