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 listJun 16, 2026 06:40Victor MerckléVictor MerckléScore: 1,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 06:431,70711,740,5453,065,0001,204,0002,113,536
2Jun 16, 2026 06:431,71211,641,5643,069,0001,211,0002,113,536
3Jun 16, 2026 06:431,72411,755,1043,101,0001,209,0002,113,536
4Jun 16, 2026 06:431,73911,728,5523,121,0001,228,0002,113,536
5Jun 16, 2026 06:431,75811,746,7353,189,0001,208,0002,113,536
6Jun 16, 2026 06:431,80711,675,4643,314,0001,205,0002,113,536
7Jun 16, 2026 06:431,86212,002,0993,451,0001,205,0002,113,536
8Jun 16, 2026 06:431,86212,011,5083,443,0001,214,0002,113,536
9Jun 16, 2026 06:431,90712,136,8413,344,0001,424,0002,113,536