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 listJun 5, 2026 18:50Elijah KinElijah KinScore: 2,756Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 18:512,51615,283,9965,187,0001,103,0002,117,632
2Jun 5, 2026 18:512,54015,338,5345,244,0001,108,0002,117,632
3Jun 5, 2026 18:512,58415,446,1565,270,0001,192,0002,117,632
4Jun 5, 2026 18:512,59215,802,6125,308,0001,174,0002,117,632
5Jun 5, 2026 18:512,75617,368,3625,753,0001,137,0002,117,632
6Jun 5, 2026 18:512,76616,071,1705,789,0001,127,0002,117,632
7Jun 5, 2026 18:512,77116,066,4685,752,0001,177,0002,117,632
8Jun 5, 2026 18:512,87416,688,0686,042,0001,143,0002,117,632
9Jun 5, 2026 18:512,90516,702,1596,127,0001,137,0002,117,632