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 22, 2026 09:51M-RochatM-RochatScore: 4,692Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 09:514,55120,705,17110,289,0001,089,0002,117,632
2May 22, 2026 09:514,67421,035,86510,587,0001,098,0002,117,632
3May 22, 2026 09:514,68421,118,88010,613,0001,099,0002,117,632
4May 22, 2026 09:514,68920,927,73910,624,0001,099,0002,117,632
5May 22, 2026 09:514,69220,982,35910,632,0001,098,0002,121,728
6May 22, 2026 09:514,69721,500,95510,644,0001,100,0002,117,632
7May 22, 2026 09:514,70021,038,66710,653,0001,099,0002,117,632
8May 22, 2026 09:514,71121,625,11610,678,0001,101,0002,117,632
9May 22, 2026 09:514,71621,625,29410,691,0001,100,0002,117,632