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 20, 2026 13:58Victor MerckléVictor MerckléScore: 2,854Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 13:592,72416,581,4735,674,0001,136,0002,113,536
2May 20, 2026 13:592,73716,965,1665,705,0001,139,0002,113,536
3May 20, 2026 13:592,78416,519,9455,817,0001,145,0002,113,536
4May 20, 2026 13:592,82017,032,0635,907,0001,143,0002,113,536
5May 20, 2026 13:592,85416,807,3345,995,0001,140,0002,113,536
6May 20, 2026 13:592,86316,993,7406,017,0001,142,0002,113,536
7May 20, 2026 13:592,86516,970,9686,020,0001,144,0002,113,536
8May 20, 2026 13:592,90817,309,5725,240,0002,032,0002,113,536
9May 20, 2026 13:592,92325,578,0015,280,0002,028,0002,113,536