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 09:49Dmitry DolgopolovDmitry DolgopolovScore: 1,651,474Success
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 09:491,651,4254,167,087,0904,128,561,51002,252,800
2May 27, 2024 09:491,651,4744,183,842,0534,128,683,84402,314,240
3May 27, 2024 09:491,651,8634,194,190,9224,129,656,33502,256,896