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 30, 2024 15:28DanielDanielScore: 1,258,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2024 15:281,257,8983,213,829,1293,144,743,99202,260,992
2Jul 30, 2024 15:281,258,2693,200,789,0273,145,672,33102,265,088
3Jul 30, 2024 15:281,258,7693,207,415,3703,146,923,70802,392,064