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 20:45Ian MckibbenIan MckibbenScore: 343,409Success
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 20:45343,223886,874,710858,057,00002,281,472
2Feb 19, 2025 20:45343,409882,748,592856,524,0001,998,0002,486,272
3Feb 19, 2025 20:45350,466906,595,933875,167,000999,0002,281,472