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 listDec 24, 2023 19:34Kenneth MaplesKenneth MaplesScore: 413,598Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 19:34413,5231,101,220,4611,033,806,28702,203,648
2Dec 24, 2023 19:34413,5981,110,938,8111,033,995,87902,183,168
3Dec 24, 2023 19:34413,7141,087,825,7031,034,285,63702,195,456