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 30, 2024 16:02DanielDanielScore: 1,058,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2024 16:021,057,7652,711,719,9242,644,412,10202,379,776
2Jul 30, 2024 16:021,058,7852,723,953,1732,646,962,12702,244,608
3Jul 30, 2024 16:021,060,9532,714,406,4682,652,381,90602,256,896