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 10:00Victor MerckléVictor MerckléScore: 2,616Success
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 10:022,53113,960,6164,991,0001,337,0002,113,536
2May 30, 2026 10:022,53214,988,1044,993,0001,337,0002,113,536
3May 30, 2026 10:022,53414,003,3174,998,0001,337,0002,113,536
4May 30, 2026 10:022,53815,855,9465,007,0001,340,0002,113,536
5May 30, 2026 10:022,61615,033,4944,257,0002,283,0002,113,536
6May 30, 2026 10:022,62015,909,6535,221,0001,331,0002,113,536
7May 30, 2026 10:022,62715,439,1355,235,0001,333,0002,113,536
8May 30, 2026 10:022,66616,124,9675,310,0001,356,0002,113,536
9May 30, 2026 10:022,69416,203,2144,439,0002,298,0002,113,536