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:32Yurkov AlekseyYurkov AlekseyScore: 1,202,385Success
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:321,202,0743,080,070,6263,005,183,97502,256,896
2Jan 3, 2024 22:321,202,3853,080,923,6213,005,962,95402,183,168
3Jan 3, 2024 22:321,205,7783,232,697,8683,014,445,59502,260,992