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 listJul 9, 2023 21:08gchebanovgchebanovScore: 1,345,983Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2023 21:081,343,2003,428,984,2433,357,999,86902,183,168
2Jul 9, 2023 21:081,345,9833,428,662,6813,364,956,85102,260,992
3Jul 9, 2023 21:081,368,7803,476,732,2183,421,950,04902,174,976