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:17Kenneth 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:1800000Error: pos 368928: expected 101 got 102stderr
2Dec 24, 2023 21:17332,069900,403,091830,172,08702,179,072
3Dec 24, 2023 21:17332,137928,719,112830,342,04202,306,048
4Dec 24, 2023 21:17332,146895,530,037830,363,78802,301,952
5Dec 24, 2023 21:17332,184889,335,884830,460,14802,306,048
6Dec 24, 2023 21:17332,201886,558,986830,501,52802,306,048
7Dec 24, 2023 21:17332,261898,573,557830,651,71902,301,952