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 05:28Victor 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 05:292,53715,025,3675,008,0001,335,0002,113,536
2May 30, 2026 05:292,54715,542,6445,030,0001,339,0002,113,536
3May 30, 2026 05:292,61514,268,0155,206,0001,332,0002,113,536
4May 30, 2026 05:292,62014,129,2855,223,0001,327,0002,113,536
5May 30, 2026 05:292,62314,308,5195,226,0001,333,0002,113,536
6May 30, 2026 05:292,62415,067,8155,229,0001,333,0002,113,536
7May 30, 2026 05:292,65114,220,2945,276,0001,352,0002,113,536
8May 30, 2026 05:292,68114,815,3564,429,0002,274,0002,113,536
9May 30, 2026 05:292,68717,501,3804,441,0002,277,0002,113,536