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:25Victor MerckléVictor MerckléScore: 2,618Success
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:262,57313,986,4615,126,0001,307,0002,113,536
2May 29, 2026 18:262,57414,778,0565,129,0001,307,0002,113,536
3May 29, 2026 18:262,59516,020,1825,169,0001,320,0002,113,536
4May 29, 2026 18:262,60015,960,9455,177,0001,325,0002,113,536
5May 29, 2026 18:262,61814,326,1585,221,0001,326,0002,113,536
6May 29, 2026 18:262,63215,136,2495,244,0001,338,0002,113,536
7May 29, 2026 18:262,68616,913,1035,413,0001,303,0002,113,536
8May 29, 2026 18:262,71015,492,5925,469,0001,307,0002,113,536
9May 29, 2026 18:262,71114,503,6855,474,0001,304,0002,113,536