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 27, 2024 16:13Joad NacerJoad NacerScore: 1,187,241Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 27, 2024 16:131,184,5483,023,564,0282,961,370,00302,285,568
2May 27, 2024 16:131,187,2413,026,959,2652,968,102,24902,285,568
3May 27, 2024 16:131,188,9343,029,003,8942,972,335,83202,293,760