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 21, 2023 22:41Mikhail ShirokovMikhail ShirokovScore: 1,189,052Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2023 22:411,189,0123,011,861,0822,972,529,75502,293,760
2Jul 21, 2023 22:411,189,0523,028,816,7492,972,630,20602,293,760
3Jul 21, 2023 22:411,189,1193,033,334,3412,972,797,21102,289,664