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 listJun 15, 2026 21:31Victor MerckléVictor MerckléScore: 1,864Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2026 21:351,81811,904,9773,269,0001,277,0002,113,536
2Jun 15, 2026 21:351,84412,040,3903,401,0001,209,0002,113,536
3Jun 15, 2026 21:351,85512,000,8403,361,0001,277,0002,113,536
4Jun 15, 2026 21:351,86312,053,2963,436,0001,222,0002,113,536
5Jun 15, 2026 21:351,86411,981,1693,440,0001,220,0002,113,536
6Jun 15, 2026 21:351,86812,053,7433,450,0001,221,0002,113,536
7Jun 15, 2026 21:351,87212,041,5443,459,0001,222,0002,113,536
8Jun 15, 2026 21:351,87812,038,0653,458,0001,239,0002,113,536
9Jun 15, 2026 21:351,90012,074,8403,439,0001,313,0002,113,536