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 07:20Victor MerckléVictor MerckléScore: 2,598Success
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 07:212,53114,468,3944,992,0001,336,0002,113,536
2May 30, 2026 07:212,53614,229,6595,003,0001,338,0002,113,536
3May 30, 2026 07:212,53714,218,8385,005,0001,338,0002,113,536
4May 30, 2026 07:212,54714,431,5725,031,0001,337,0002,113,536
5May 30, 2026 07:212,59814,353,9115,139,0001,356,0002,113,536
6May 30, 2026 07:212,59815,337,4965,125,0001,371,0002,113,536
7May 30, 2026 07:212,63214,281,9675,245,0001,335,0002,113,536
8May 30, 2026 07:212,64014,864,0785,263,0001,338,0002,113,536
9May 30, 2026 07:212,66214,448,1185,305,0001,352,0002,113,536