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:19M-RochatM-RochatScore: 4,688Success
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:194,54520,683,92010,276,0001,087,0002,117,632
2May 20, 2026 16:194,67420,964,25610,590,0001,096,0002,117,632
3May 20, 2026 16:194,67720,948,25910,596,0001,097,0002,117,632
4May 20, 2026 16:194,68621,097,13010,621,0001,096,0002,117,632
5May 20, 2026 16:194,68821,095,51110,624,0001,097,0002,121,728
6May 20, 2026 16:194,69320,964,57310,635,0001,099,0002,121,728
7May 20, 2026 16:194,69421,131,12210,640,0001,097,0002,121,728
8May 20, 2026 16:194,69521,595,30210,641,0001,098,0002,117,632
9May 20, 2026 16:194,69821,044,80210,647,0001,098,0002,117,632