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:29M-RochatM-RochatScore: 4,568Success
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:294,54620,654,23210,277,0001,088,0002,117,632
2May 20, 2026 16:294,54820,630,14210,284,0001,087,0002,121,728
3May 20, 2026 16:294,54820,692,00510,283,0001,088,0002,117,632
4May 20, 2026 16:294,55420,674,93010,297,0001,088,0002,117,632
5May 20, 2026 16:294,56821,074,76310,332,0001,089,0002,117,632
6May 20, 2026 16:294,67621,311,48010,591,0001,099,0002,117,632
7May 20, 2026 16:294,68220,980,90810,608,0001,098,0002,117,632
8May 20, 2026 16:294,68620,973,36310,616,0001,099,0002,117,632
9May 20, 2026 16:294,69921,586,23310,649,0001,099,0002,117,632