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:24Kenneth MaplesKenneth MaplesScore: 341,108Success
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:24340,945903,641,579852,361,63302,301,952
2Dec 24, 2023 19:24341,108916,211,426852,770,50002,306,048
3Dec 24, 2023 19:24341,159919,415,656852,896,46902,297,856