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 21:14Kenneth MaplesKenneth MaplesError
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 21:1600000Error: pos 368928: expected 242 got 243stderr
2Dec 24, 2023 21:14332,066885,846,476830,164,88502,260,992
3Dec 24, 2023 21:14332,136892,183,034830,338,87402,248,704
4Dec 24, 2023 21:14332,311906,726,466830,776,93602,306,048