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 listDec 30, 2025 23:24Aniruddha DebAniruddha DebScore: 3,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 23:243,34823,636,8587,323,0001,046,0002,281,472
2Dec 30, 2025 23:243,37025,448,8397,372,0001,053,0002,510,848
3Dec 30, 2025 23:243,39124,275,5316,359,0002,119,0002,277,376