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 21, 2026 18:31Jacob McDanielJacob McDanielScore: 2,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:322,42616,101,5234,876,0001,190,0002,117,632
2May 21, 2026 18:322,44815,481,7104,920,0001,200,0002,117,632
3May 21, 2026 18:322,45017,380,3994,923,0001,203,0002,117,632
4May 21, 2026 18:322,46115,465,0314,942,0001,212,0002,117,632
5May 21, 2026 18:322,46917,405,2434,958,0001,215,0002,117,632
6May 21, 2026 18:322,47216,738,0504,964,0001,218,0002,117,632
7May 21, 2026 18:322,53515,916,8855,079,0001,260,0002,117,632
8May 21, 2026 18:322,60217,531,6565,239,0001,268,0002,117,632
9May 21, 2026 18:322,61818,928,6635,269,0001,276,0002,117,632