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 16:39Sergey StreminSergey StreminScore: 1,077,390Success
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 16:391,076,7972,761,347,1902,691,991,33502,269,184
2Dec 2, 2023 16:391,077,3902,777,182,0242,693,474,15902,232,320
3Dec 2, 2023 16:391,077,5562,748,339,1102,693,889,03102,228,224