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:38Victor MerckléVictor MerckléScore: 2,627Success
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:392,53315,503,9214,998,0001,336,0002,113,536
2May 30, 2026 07:392,53415,438,7725,000,0001,336,0002,113,536
3May 30, 2026 07:392,53614,104,8965,005,0001,336,0002,113,536
4May 30, 2026 07:392,54116,048,0705,012,0001,341,0002,113,536
5May 30, 2026 07:392,62716,085,6085,236,0001,333,0002,113,536
6May 30, 2026 07:392,63114,234,1815,241,0001,338,0002,113,536
7May 30, 2026 07:392,64714,311,4695,283,0001,335,0002,113,536
8May 30, 2026 07:392,65216,253,0135,288,0001,344,0002,113,536
9May 30, 2026 07:392,65814,245,1095,296,0001,349,0002,113,536