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:27Kenneth MaplesKenneth MaplesScore: 332,430Success
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:27332,388886,414,591830,970,35502,183,168
2Dec 24, 2023 21:27332,430890,715,484831,075,56702,297,856
3Dec 24, 2023 21:27332,467892,998,775831,168,63902,297,856