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:49M-RochatM-RochatScore: 4,558Success
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:494,54420,755,97910,272,0001,088,0002,117,632
2May 20, 2026 16:494,54620,803,85310,278,0001,088,0002,117,632
3May 20, 2026 16:494,55320,725,44310,296,0001,087,0002,117,632
4May 20, 2026 16:494,55520,819,05710,300,0001,089,0002,117,632
5May 20, 2026 16:494,55820,691,51610,305,0001,090,0002,121,728
6May 20, 2026 16:494,62821,046,61910,467,0001,103,0002,117,632
7May 20, 2026 16:494,67421,386,92510,586,0001,099,0002,121,728
8May 20, 2026 16:494,68321,623,94010,610,0001,098,0002,117,632
9May 20, 2026 16:494,69821,642,27210,647,0001,099,0002,117,632