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 19, 2023 10:12Kenneth MaplesKenneth MaplesScore: 1,185,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2023 10:121,185,6343,023,954,0422,964,084,77202,174,976
2Dec 19, 2023 10:121,185,7903,037,882,2602,964,474,45102,179,072
3Dec 19, 2023 10:121,187,4853,034,026,9902,968,712,10002,174,976