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 21:29Kenneth MaplesKenneth MaplesScore: 320,423Success
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 21:29320,381854,187,551800,953,71602,191,360
2Dec 24, 2023 21:29320,423869,902,404801,056,74602,191,360
3Dec 24, 2023 21:29320,454852,985,085801,134,34402,191,360