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 listOct 7, 2024 20:58Joad NacerJoad NacerScore: 4,224,434Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2024 20:584,224,25610,595,876,41510,560,641,00002,297,856
2Oct 7, 2024 20:584,224,43410,595,330,90710,560,087,000999,0002,289,664
3Oct 7, 2024 20:584,225,68710,591,431,55110,563,218,000999,0002,289,664