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:33Mikhail ShirokovMikhail ShirokovScore: 2,823,362Success
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:332,821,8867,112,240,6207,054,714,89602,269,184
2Jul 21, 2023 22:332,823,3627,123,073,1217,058,405,15802,260,992
3Jul 21, 2023 22:332,828,9957,136,403,5707,072,488,19602,306,048