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: 505,552Success
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:45505,4861,284,542,5971,263,715,00002,281,472
2Feb 19, 2025 20:45505,5521,293,951,6441,262,880,000999,0002,281,472
3Feb 19, 2025 20:45505,8611,290,769,7261,262,654,0001,999,0002,482,176