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 29, 2025 21:15Aniruddha DebAniruddha DebScore: 6,506Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 21:156,27531,193,39010,459,0005,229,0002,404,352
2Dec 29, 2025 21:156,50634,917,49113,216,0003,050,0002,539,520
3Dec 29, 2025 21:156,67143,977,37912,508,0004,169,0002,502,656