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 21, 2023 09:29Oleg KovalovOleg KovalovScore: 4,652,422Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2023 09:294,645,09511,675,246,75511,612,736,69002,187,264
2Dec 21, 2023 09:294,652,42211,685,986,51711,631,055,89502,256,896
3Dec 21, 2023 09:294,656,02511,708,530,46011,640,061,35802,256,896