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 listNov 18, 2025 22:20Yuriy LyfenkoYuriy LyfenkoScore: 4,134Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 18, 2025 22:204,05927,718,7148,118,0002,029,0002,383,872
2Nov 18, 2025 22:204,13430,473,2828,269,0002,067,0002,420,736
3Nov 18, 2025 22:204,21632,131,6377,378,0003,162,0002,375,680