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 16:42Kenneth MaplesKenneth MaplesScore: 423,693Success
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 16:42423,6911,123,511,4631,059,227,38302,289,664
2Dec 24, 2023 16:42423,6931,141,623,7531,059,232,54002,293,760
3Dec 24, 2023 16:42423,6981,134,808,3861,059,246,08102,293,760