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 listDec 3, 2023 12:15Sergey StreminSergey StreminScore: 1,093,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2023 12:151,093,6252,801,643,9892,734,061,75602,224,128
2Dec 3, 2023 12:151,093,9722,802,840,7812,734,929,39902,228,224
3Dec 3, 2023 12:151,094,4572,802,222,7312,736,142,35102,220,032