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 listJul 1, 2025 20:03Aniruddha DebAniruddha DebScore: 6,530Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2025 20:036,52037,354,61112,225,0004,075,0002,420,736
2Jul 1, 2025 20:036,53035,791,46415,304,0001,020,0002,387,968
3Jul 1, 2025 20:036,61537,997,61714,471,0002,067,0002,519,040