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 listOct 7, 2026 21:39Karthik ReddyKarthik ReddyScore: 1,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2026 21:401,44812,535,1752,354,0001,266,000524,288
2Oct 7, 2026 21:401,46512,562,6763,664,0000524,288
3Oct 7, 2026 21:401,46912,520,7243,673,0000524,288
4Oct 7, 2026 21:401,47412,571,1292,552,0001,133,000524,288
5Oct 7, 2026 21:401,47412,540,4762,398,0001,287,000524,288
6Oct 7, 2026 21:401,47412,591,9702,396,0001,289,000524,288
7Oct 7, 2026 21:401,53612,781,5082,549,0001,291,000524,288
8Oct 7, 2026 21:401,61412,925,5182,695,0001,340,000524,288
9Oct 7, 2026 21:401,62612,977,7962,775,0001,292,000524,288