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 30, 2026 08:37Victor MerckléVictor MerckléScore: 2,623Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 08:392,53114,205,8384,995,0001,334,0002,113,536
2May 30, 2026 08:392,53317,720,7234,997,0001,336,0002,113,536
3May 30, 2026 08:392,53415,914,8074,996,0001,340,0002,113,536
4May 30, 2026 08:392,54116,663,6955,016,0001,337,0002,113,536
5May 30, 2026 08:392,62315,005,2945,225,0001,334,0002,113,536
6May 30, 2026 08:392,65014,990,5935,290,0001,337,0002,113,536
7May 30, 2026 08:392,68215,279,5554,418,0002,288,0002,113,536
8May 30, 2026 08:392,68314,449,8244,419,0002,290,0002,113,536
9May 30, 2026 08:392,69615,430,2544,464,0002,277,0002,113,536