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 listNov 26, 2023 17:44mmalczakmmalczakScore: 1,574,550Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 26, 2023 17:441,574,2124,002,562,1113,935,529,52602,179,072
2Nov 26, 2023 17:441,574,5504,006,645,4543,936,374,64602,179,072
3Nov 26, 2023 17:441,574,5873,980,028,1513,936,466,72202,183,168