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 20:11Kenneth MaplesKenneth MaplesScore: 251,995Success
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 20:11251,893682,069,158629,732,86402,207,744
2Dec 24, 2023 20:11251,995685,682,242629,986,27802,191,360
3Dec 24, 2023 20:11252,047686,222,780630,117,49702,195,456