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 3, 2024 22:23Yurkov AlekseyYurkov AlekseyScore: 1,651,825Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2024 22:231,651,7744,178,772,1384,129,436,10702,293,760
2Jan 3, 2024 22:231,651,8254,183,504,0744,129,561,25902,297,856
3Jan 3, 2024 22:231,655,3054,187,942,6584,138,262,84402,293,760