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 11:59Kenneth MaplesKenneth MaplesScore: 722,550Success
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 11:59722,3341,859,987,4761,805,835,24202,179,072
2Dec 19, 2023 11:59722,5501,873,094,9401,806,374,78502,297,856
3Dec 19, 2023 11:59722,6881,881,053,3471,806,720,35202,174,976