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:33Yurkov AlekseyYurkov AlekseyScore: 1,201,630Success
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:331,201,2413,070,192,2123,003,101,38602,191,360
2Jan 3, 2024 22:331,201,6303,061,824,9673,004,075,21802,183,168
3Jan 3, 2024 22:331,202,9803,061,043,7973,007,448,86502,195,456