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:09Aniruddha DebAniruddha DebScore: 8,620Success
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:098,61344,765,30817,431,0004,101,0002,387,968
2Dec 29, 2025 21:098,62050,454,06317,446,0004,105,0002,392,064
3Dec 29, 2025 21:098,63256,549,46817,470,0004,110,0002,387,968