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:35Kenneth MaplesKenneth MaplesScore: 333,352Success
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:35333,322890,378,113833,304,56602,195,456
2Dec 24, 2023 19:35333,352899,259,200833,379,75402,179,072
3Dec 24, 2023 19:35333,446899,369,711833,614,62802,191,360