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 20, 2026 15:12Victor MerckléVictor MerckléScore: 2,835Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 15:152,80715,521,3245,658,0001,361,0002,113,536
2May 20, 2026 15:152,81716,984,4835,677,0001,366,0002,113,536
3May 20, 2026 15:152,81816,056,0985,684,0001,363,0002,113,536
4May 20, 2026 15:152,81815,659,9365,681,0001,366,0002,113,536
5May 20, 2026 15:152,83514,897,2055,718,0001,370,0002,113,536
6May 20, 2026 15:152,87015,208,0824,797,0002,378,0002,113,536
7May 20, 2026 15:152,91717,010,6835,933,0001,360,0002,113,536
8May 20, 2026 15:152,95315,917,6725,070,0002,314,0002,113,536
9May 20, 2026 15:152,95417,001,8154,960,0002,426,0002,113,536