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 10, 2023 13:30Yuriy LyfenkoYuriy LyfenkoScore: 4,024,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2023 13:304,023,73410,130,608,13710,059,335,83302,293,760
2Jul 10, 2023 13:304,024,00510,135,718,75110,060,011,77202,293,760
3Jul 10, 2023 13:304,031,81810,140,467,58310,079,545,80302,306,048