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:30Kenneth MaplesKenneth MaplesScore: 341,303Success
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:30340,847917,990,511852,116,72002,293,760
2Dec 24, 2023 19:30341,303913,881,045853,258,66002,297,856
3Dec 24, 2023 19:30341,326908,120,633853,315,31202,297,856