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:17Jacob McDanielJacob McDanielScore: 2,778Success
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:172,73818,827,9605,651,0001,196,0002,121,728
2May 20, 2026 11:172,75018,149,1315,681,0001,195,0002,121,728
3May 20, 2026 11:172,76019,154,9865,695,0001,207,0002,121,728
4May 20, 2026 11:172,76520,432,6405,704,0001,209,0002,121,728
5May 20, 2026 11:172,77818,306,7595,735,0001,212,0002,121,728
6May 20, 2026 11:172,78716,892,4605,739,0001,230,0002,113,536
7May 20, 2026 11:172,83120,100,2625,805,0001,274,0002,121,728
8May 20, 2026 11:172,88318,756,4855,922,0001,287,0002,121,728
9May 20, 2026 11:172,94317,767,6706,069,0001,290,0002,121,728