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:11Kenneth MaplesKenneth MaplesScore: 341,141Success
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:11340,949920,108,652852,371,43902,174,976
2Dec 24, 2023 19:11341,141928,047,731852,853,64302,179,072
3Dec 24, 2023 19:11341,236913,313,708853,090,52602,179,072