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 2, 2023 17:15Sergey StreminSergey StreminScore: 1,073,065Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 2, 2023 17:151,072,9342,754,995,2482,682,334,18702,224,128
2Dec 2, 2023 17:151,073,0652,745,229,1042,682,663,09502,220,032
3Dec 2, 2023 17:151,073,7952,754,142,4082,684,486,66502,224,128