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:28M-RochatM-RochatScore: 4,555Success
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:284,54020,741,53410,265,0001,087,0002,117,632
2May 20, 2026 16:284,54420,709,05310,275,0001,087,0002,117,632
3May 20, 2026 16:284,54620,678,05910,278,0001,087,0002,117,632
4May 20, 2026 16:284,55320,671,42310,295,0001,088,0002,117,632
5May 20, 2026 16:284,55521,218,30610,299,0001,089,0002,121,728
6May 20, 2026 16:284,55520,683,40310,300,0001,089,0002,121,728
7May 20, 2026 16:284,68521,021,94310,613,0001,100,0002,117,632
8May 20, 2026 16:284,69621,019,68210,644,0001,098,0002,121,728
9May 20, 2026 16:284,69820,950,96310,649,0001,098,0002,117,632