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 listAug 23, 2023 05:05LiamLiamScore: 1,575,792Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2023 05:051,574,6013,974,777,9803,936,501,59902,179,072
2Aug 23, 2023 05:051,575,7924,002,803,6453,939,480,95702,256,896
3Aug 23, 2023 05:051,576,5283,998,953,1483,941,319,49302,306,048