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 11:38Karthik ReddyKarthik ReddyScore: 1,282Success
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 11:581,27312,065,5671,668,0001,515,000524,288
2Oct 9, 2026 11:581,27511,998,3541,933,0001,255,000524,288
3Oct 9, 2026 11:581,27712,000,5201,934,0001,260,000524,288
4Oct 9, 2026 11:581,28012,022,2951,711,0001,491,000524,288
5Oct 9, 2026 11:581,28212,051,0641,682,0001,524,000524,288
6Oct 9, 2026 11:581,28212,037,9301,945,0001,261,000524,288
7Oct 9, 2026 11:581,29012,035,5001,955,0001,270,000524,288
8Oct 9, 2026 11:581,39012,315,8882,419,0001,056,000524,288
9Oct 9, 2026 11:581,50412,574,3132,636,0001,124,000524,288