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 21:31Victor MerckléVictor MerckléScore: 2,555Success
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 21:332,54115,356,7075,025,0001,328,0002,113,536
2May 29, 2026 21:332,54915,935,9375,041,0001,332,0002,113,536
3May 29, 2026 21:332,55217,330,8105,049,0001,333,0002,113,536
4May 29, 2026 21:332,55414,223,5635,056,0001,331,0002,113,536
5May 29, 2026 21:332,55516,023,2445,051,0001,338,0002,113,536
6May 29, 2026 21:332,61414,741,2114,272,0002,264,0002,113,536
7May 29, 2026 21:332,61614,177,7504,273,0002,267,0002,113,536
8May 29, 2026 21:332,62914,734,0825,245,0001,329,0002,113,536
9May 29, 2026 21:332,67815,846,0755,344,0001,352,0002,113,536