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:54Victor MerckléVictor MerckléScore: 2,672Success
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:562,57516,699,6845,091,0001,348,0002,113,536
2May 30, 2026 08:562,58317,377,2435,110,0001,349,0002,113,536
3May 30, 2026 08:562,66816,535,2495,327,0001,343,0002,113,536
4May 30, 2026 08:562,67014,657,8535,328,0001,347,0002,113,536
5May 30, 2026 08:562,67215,212,5165,338,0001,344,0002,113,536
6May 30, 2026 08:562,67314,463,7765,315,0001,368,0002,113,536
7May 30, 2026 08:562,70116,738,4325,394,0001,359,0002,113,536
8May 30, 2026 08:562,70915,026,9154,476,0002,297,0002,113,536
9May 30, 2026 08:562,74214,589,3384,560,0002,297,0002,113,536