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 listFeb 23, 2024 10:36Huy Duc LeHuy Duc LeScore: 1,651,507Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2024 10:361,651,4854,191,921,4764,128,711,44902,252,800
2Feb 23, 2024 10:361,651,5074,207,392,9364,128,767,82502,310,144
3Feb 23, 2024 10:361,651,5284,188,943,6914,128,820,65002,187,264