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 10, 2023 13:28Yuriy LyfenkoYuriy LyfenkoScore: 1,574,304Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2023 13:281,573,8743,974,861,4573,934,684,72902,293,760
2Jul 10, 2023 13:281,574,3044,002,481,3963,935,759,23702,293,760
3Jul 10, 2023 13:281,574,7153,976,230,1233,936,786,66102,285,568