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 20, 2023 01:11Kenneth MaplesKenneth MaplesScore: 722,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2023 01:11722,1111,879,397,9171,805,276,83602,301,952
2Dec 20, 2023 01:11722,5181,874,651,9031,806,296,13802,174,976
3Dec 20, 2023 01:11723,0591,864,045,2991,807,648,47802,301,952