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 19:35Kenneth MaplesKenneth MaplesScore: 425,775Success
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 19:35425,6841,123,514,9681,064,210,09502,195,456
2Dec 24, 2023 19:35425,7751,137,218,3051,064,438,49502,195,456
3Dec 24, 2023 19:35425,9091,120,297,4321,064,772,56102,191,360