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:34Kenneth MaplesKenneth MaplesScore: 340,889Success
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:34340,789919,381,131851,972,82102,301,952
2Dec 24, 2023 19:34340,889914,015,614852,223,68602,301,952
3Dec 24, 2023 19:34340,963907,504,245852,407,70402,293,760