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:26Yurkov AlekseyYurkov AlekseyScore: 1,582,123Success
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:261,581,9024,019,690,3973,954,755,64702,256,896
2Jan 3, 2024 22:261,582,1234,009,488,2393,955,307,82102,252,800
3Jan 3, 2024 22:261,582,5524,014,672,7223,956,380,34602,301,952