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 07:35Karthik ReddyKarthik ReddyScore: 1,430Success
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 07:361,26111,938,0641,903,0001,250,000524,288
2Oct 9, 2026 07:361,39912,314,1512,361,0001,138,000524,288
3Oct 9, 2026 07:361,42312,452,8712,432,0001,127,000524,288
4Oct 9, 2026 07:361,42612,287,3772,443,0001,123,000524,288
5Oct 9, 2026 07:361,43012,330,4982,457,0001,120,000524,288
6Oct 9, 2026 07:361,45212,393,4622,477,0001,155,000524,288
7Oct 9, 2026 07:361,45212,341,9842,484,0001,148,000524,288
8Oct 9, 2026 07:361,45212,396,6772,476,0001,154,000524,288
9Oct 9, 2026 07:361,47512,399,7052,532,0001,156,000524,288