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 listMay 29, 2026 18:49Victor MerckléVictor MerckléScore: 2,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 18:502,57714,207,0455,130,0001,314,0002,113,536
2May 29, 2026 18:502,58514,963,8175,149,0001,315,0002,113,536
3May 29, 2026 18:502,66714,398,5315,329,0001,340,0002,113,536
4May 29, 2026 18:502,69015,477,5185,416,0001,309,0002,113,536
5May 29, 2026 18:502,69116,750,2955,419,0001,310,0002,113,536
6May 29, 2026 18:502,69416,055,0975,428,0001,307,0002,113,536
7May 29, 2026 18:502,69815,416,8365,436,0001,309,0002,113,536
8May 29, 2026 18:502,70317,472,7995,436,0001,323,0002,113,536
9May 29, 2026 18:502,74616,687,6775,528,0001,339,0002,113,536