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 listApr 29, 2024 22:51Joad NacerJoad NacerScore: 1,188,863Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2024 22:511,183,8553,027,706,5172,959,636,29702,199,552
2Apr 29, 2024 22:511,188,8633,040,389,8842,972,157,20702,203,648
3Apr 29, 2024 22:511,189,7743,040,786,5752,974,435,70302,195,456