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 24, 2023 16:40Oleg KovalovOleg KovalovScore: 1,682,856Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 16:401,682,2504,270,255,4314,205,625,87502,252,800
2Dec 24, 2023 16:411,682,6034,274,898,2184,206,508,30202,256,896
3Dec 24, 2023 16:411,682,7464,272,527,2214,206,864,28702,260,992
4Dec 24, 2023 16:411,682,8564,285,594,8124,207,139,87302,260,992
5Dec 24, 2023 16:401,683,0544,275,984,3144,207,636,14602,265,088
6Dec 24, 2023 16:401,683,1814,266,359,7124,207,951,43202,260,992