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:39M-RochatM-RochatScore: 4,681Success
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:394,55120,649,98310,291,0001,088,0002,117,632
2May 20, 2026 16:394,55420,674,08810,297,0001,089,0002,121,728
3May 20, 2026 16:394,55920,671,56310,309,0001,089,0002,121,728
4May 20, 2026 16:394,67321,002,80810,585,0001,098,0002,117,632
5May 20, 2026 16:394,68120,932,62910,607,0001,097,0002,121,728
6May 20, 2026 16:394,68220,919,57810,609,0001,098,0002,117,632
7May 20, 2026 16:394,68420,933,49610,613,0001,098,0002,121,728
8May 20, 2026 16:394,69821,059,24810,647,0001,098,0002,117,632
9May 20, 2026 16:394,70421,250,58010,661,0001,100,0002,117,632