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 listNov 26, 2023 17:46mmalczakmmalczakScore: 1,574,412Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 26, 2023 17:461,574,3913,992,946,9003,935,978,56002,252,800
2Nov 26, 2023 17:461,574,4124,007,099,8853,936,028,93002,183,168
3Nov 26, 2023 17:461,576,1653,989,696,4963,940,412,72202,187,264