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 listJul 29, 2024 03:44Nimish GuptaNimish GuptaScore: 1,652,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2024 03:441,652,0194,179,842,1494,130,046,85702,191,360
2Jul 29, 2024 03:441,652,1014,182,788,5914,130,251,42302,183,168
3Jul 29, 2024 03:441,652,5304,179,912,2784,131,325,28402,187,264