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 19, 2023 09:42Kenneth MaplesKenneth MaplesScore: 1,246,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2023 09:421,245,9473,190,324,3363,114,867,72802,183,168
2Dec 19, 2023 09:421,246,7083,178,146,0193,116,769,70002,256,896
3Dec 19, 2023 09:421,247,7643,188,811,1803,119,410,78902,191,360