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 listMay 20, 2026 11:21Jacob McDanielJacob McDanielScore: 2,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 11:222,65518,529,6605,457,0001,181,0002,117,632
2May 20, 2026 11:222,67316,903,8685,500,0001,183,0002,117,632
3May 20, 2026 11:222,68217,663,1685,492,0001,214,0002,117,632
4May 20, 2026 11:222,75116,531,6395,610,0001,268,0002,117,632
5May 20, 2026 11:222,76817,995,4135,660,0001,262,0002,117,632
6May 20, 2026 11:222,77516,754,9475,664,0001,275,0002,117,632
7May 20, 2026 11:222,78919,224,6565,705,0001,268,0002,117,632
8May 20, 2026 11:222,79416,431,5095,711,0001,276,0002,117,632
9May 20, 2026 11:222,79916,443,9855,724,0001,274,0002,117,632