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:45Mikhail ShirokovMikhail ShirokovScore: 940,615Success
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:45940,4802,407,094,9082,351,200,98902,289,664
2Jul 21, 2023 22:45940,6152,418,902,8792,351,536,82102,297,856
3Jul 21, 2023 22:45940,7662,409,078,7372,351,915,40702,293,760