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:31M-RochatM-RochatScore: 4,554Success
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:314,54320,945,56710,271,0001,088,0002,117,632
2May 20, 2026 16:314,54420,819,73410,273,0001,087,0002,117,632
3May 20, 2026 16:314,54720,672,89610,282,0001,087,0002,117,632
4May 20, 2026 16:314,54820,775,66710,284,0001,088,0002,121,728
5May 20, 2026 16:314,55420,672,15710,298,0001,089,0002,121,728
6May 20, 2026 16:314,56020,817,64510,313,0001,089,0002,121,728
7May 20, 2026 16:314,56020,685,79810,310,0001,090,0002,117,632
8May 20, 2026 16:314,68321,346,62410,610,0001,099,0002,117,632
9May 20, 2026 16:314,69121,141,77010,629,0001,100,0002,121,728