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 listOct 16, 2024 10:28Huy Duc LeHuy Duc LeScore: 24,484Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2024 10:2824,39687,388,38747,993,00012,998,0002,437,120
2Oct 16, 2024 10:2824,48496,734,94151,175,00010,034,0002,318,336
3Oct 16, 2024 10:2824,58391,995,98749,368,00012,090,0002,359,296