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 listSep 26, 2023 20:41apuxbtapuxbtScore: 1,651,792Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2023 20:411,651,1184,190,610,8564,127,794,34102,256,896
2Sep 26, 2023 20:411,651,7924,167,346,3994,129,479,73102,187,264
3Sep 26, 2023 20:411,652,2814,201,975,5554,130,702,16602,306,048