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 22, 2023 18:21Ilya AniskovetsIlya AniskovetsScore: 1,651,799Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2023 18:211,650,8384,184,842,7364,127,094,87302,179,072
2Aug 22, 2023 18:211,651,7994,191,286,8174,129,496,27202,179,072
3Aug 22, 2023 18:211,652,2054,183,304,1584,130,513,63802,183,168