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 listNov 2, 2026 21:34Andrew EpsteinAndrew EpsteinScore: 12,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2026 21:3512,71041,433,51630,635,0001,141,0002,117,632stderr
2Nov 2, 2026 21:3512,72541,470,86730,678,0001,135,0002,117,632stderr
3Nov 2, 2026 21:3512,74241,556,82130,669,0001,187,0002,117,632stderr
4Nov 2, 2026 21:3512,76241,492,30030,712,0001,195,0002,117,632stderr
5Nov 2, 2026 21:3512,76241,599,14030,691,0001,214,0002,117,632stderr
6Nov 2, 2026 21:3512,76641,536,70330,766,0001,149,0002,117,632stderr
7Nov 2, 2026 21:3512,77541,618,84330,794,0001,144,0002,117,632stderr
8Nov 2, 2026 21:3512,77841,572,16530,797,0001,149,0002,117,632stderr
9Nov 2, 2026 21:3512,86141,967,71431,122,0001,031,0002,117,632stderr