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 9, 2026 08:26Karthik ReddyKarthik ReddyScore: 1,366Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 09:401,25911,992,2801,864,0001,284,000524,288
2Oct 9, 2026 09:401,27512,069,0951,727,0001,461,000524,288
3Oct 9, 2026 09:401,28112,074,3702,162,0001,041,000524,288
4Oct 9, 2026 09:401,36512,353,7242,394,0001,020,000524,288
5Oct 9, 2026 09:401,36621,590,6342,059,0001,358,000524,288
6Oct 9, 2026 09:401,39812,332,7582,447,0001,049,000524,288
7Oct 9, 2026 09:401,48712,426,8622,586,0001,132,000524,288
8Oct 9, 2026 09:401,48712,507,3382,583,0001,136,000524,288
9Oct 9, 2026 09:401,49712,509,3272,616,0001,128,000524,288