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 listMay 7, 2024 18:44Joad NacerJoad NacerScore: 1,189,528Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2024 18:441,184,9513,026,296,1512,962,378,15502,187,264
2May 7, 2024 18:441,189,5283,043,027,4172,973,819,94502,179,072
3May 7, 2024 18:441,190,8623,029,395,0362,977,154,94302,179,072