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:45Kenneth MaplesKenneth MaplesScore: 66,139Success
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:4566,104245,154,419165,260,46602,260,992
2Dec 24, 2023 21:4566,139227,214,260165,347,16602,269,184
3Dec 24, 2023 21:4566,149233,320,081165,371,48402,265,088