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 listFeb 23, 2024 15:59Huy Duc LeHuy Duc LeScore: 4,930,155Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2024 15:594,860,57531,178,345,60212,151,436,93902,338,816
2Feb 23, 2024 15:594,930,15531,257,522,98612,325,386,88602,367,488
3Feb 23, 2024 15:594,937,35031,536,082,32212,343,375,25602,379,776