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:52M-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:524,54420,742,24110,272,0001,088,0002,117,632
2May 20, 2026 16:524,54720,703,91910,279,0001,089,0002,117,632
3May 20, 2026 16:524,55620,801,81510,300,0001,090,0002,117,632
4May 20, 2026 16:524,55820,709,62910,307,0001,089,0002,117,632
5May 20, 2026 16:524,55820,837,82110,306,0001,089,0002,117,632
6May 20, 2026 16:524,57821,322,62310,353,0001,092,0002,117,632
7May 20, 2026 16:524,68821,688,53610,620,0001,101,0002,117,632
8May 20, 2026 16:524,69321,257,06310,637,0001,097,0002,117,632
9May 20, 2026 16:524,72121,861,84710,702,0001,102,0002,117,632