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 listJan 3, 2024 22:27Yurkov AlekseyYurkov AlekseyScore: 1,581,852Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2024 22:271,581,5354,011,153,5873,953,836,73702,179,072
2Jan 3, 2024 22:271,581,8524,015,349,8643,954,629,95002,179,072
3Jan 3, 2024 22:271,582,2174,014,547,0383,955,542,11302,179,072