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 19, 2025 02:10Ian MckibbenIan MckibbenScore: 342,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2025 02:10342,282882,357,787853,707,0001,999,0002,281,472
2Feb 19, 2025 02:10342,471881,476,253855,177,0001,000,0002,490,368
3Feb 19, 2025 02:10344,523890,924,755860,308,0001,000,0002,281,472