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 06:31Victor MerckléVictor MerckléScore: 2,626Success
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 06:332,53515,996,3345,007,0001,331,0002,113,536
2May 30, 2026 06:332,56316,153,0615,054,0001,354,0002,113,536
3May 30, 2026 06:332,62114,344,7845,226,0001,328,0002,113,536
4May 30, 2026 06:332,62414,178,8855,236,0001,325,0002,113,536
5May 30, 2026 06:332,62614,365,2735,234,0001,331,0002,113,536
6May 30, 2026 06:332,62815,197,6945,241,0001,330,0002,113,536
7May 30, 2026 06:332,63815,340,6025,261,0001,334,0002,113,536
8May 30, 2026 06:332,68414,294,4504,429,0002,281,0002,113,536
9May 30, 2026 06:332,68716,309,4914,417,0002,301,0002,113,536