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 listJan 31, 2024 13:15AnSaAnSaScore: 1,573,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2024 13:151,573,5063,989,720,2033,933,765,15602,297,856
2Jan 31, 2024 13:151,573,9703,996,285,3623,934,924,60502,301,952
3Jan 31, 2024 13:151,574,6253,989,373,0913,936,561,27302,174,976