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 listSep 15, 2026 17:28Josu San MartinJosu San MartinScore: 2,748Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 17:282,74115,554,9515,753,0001,101,0002,117,632
2Sep 15, 2026 17:282,74615,568,8095,764,0001,102,0002,117,632
3Sep 15, 2026 17:282,74715,350,9955,765,0001,104,0002,117,632
4Sep 15, 2026 17:282,74815,558,0725,770,0001,101,0002,117,632
5Sep 15, 2026 17:282,74815,487,2165,769,0001,103,0002,117,632
6Sep 15, 2026 17:282,75415,613,0885,781,0001,104,0002,117,632
7Sep 15, 2026 17:282,76015,645,5165,796,0001,105,0002,117,632
8Sep 15, 2026 17:282,76115,446,3785,800,0001,104,0002,117,632
9Sep 15, 2026 17:282,81415,741,6245,904,0001,132,0002,117,632