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:38Mikhail ShirokovMikhail ShirokovScore: 1,438,152Success
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:381,438,1193,663,289,2753,595,298,59302,244,608
2Jul 21, 2023 22:381,438,1523,665,778,2533,595,379,33502,285,568
3Jul 21, 2023 22:381,438,1653,664,294,6883,595,411,89302,293,760