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 18, 2026 06:29Jacob McDanielJacob McDanielScore: 2,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 06:362,76315,915,3845,715,0001,194,0002,117,632
2May 18, 2026 06:362,79419,146,4945,765,0001,222,0002,117,632
3May 18, 2026 06:362,80417,711,7985,808,0001,204,0002,117,632
4May 18, 2026 06:362,80917,327,9145,801,0001,222,0002,117,632
5May 18, 2026 06:362,84617,155,7835,915,0001,202,0002,117,632
6May 18, 2026 06:362,85618,571,4536,006,0001,136,0002,117,632
7May 18, 2026 06:362,85916,702,1076,016,0001,132,0002,117,632
8May 18, 2026 06:362,86616,491,0375,948,0001,218,0002,117,632
9May 18, 2026 06:362,87718,687,2915,945,0001,248,0002,117,632