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 listApr 13, 2026 14:31limanjun99limanjun99Score: 3,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 14:313,05724,799,5195,459,0002,183,0002,293,760
2Apr 13, 2026 14:313,06123,305,7386,560,0001,093,0002,527,232
3Apr 13, 2026 14:313,06723,474,3825,477,0002,191,0002,293,760
4Apr 13, 2026 14:313,17024,611,8664,954,0002,972,0002,273,280
5Apr 13, 2026 14:313,17423,869,6865,951,0001,983,0002,293,760
6Apr 13, 2026 14:313,20428,558,1735,007,0003,004,0002,269,184