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:23Sergey StreminSergey StreminScore: 1,073,074Success
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:231,072,8982,737,473,5462,682,244,52202,224,128
2Dec 3, 2023 12:231,073,0742,756,445,9762,682,683,92902,224,128
3Dec 3, 2023 12:231,073,7142,752,419,6492,684,284,92602,232,320