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 22:23Jacob McDanielJacob McDanielScore: 2,922Success
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 22:232,82418,124,4085,801,0001,260,0002,117,632
2May 21, 2026 22:232,88519,354,2825,925,0001,289,0002,117,632
3May 21, 2026 22:232,90519,137,1585,961,0001,302,0002,117,632
4May 21, 2026 22:232,91418,161,3925,996,0001,290,0002,117,632
5May 21, 2026 22:232,92216,573,4146,020,0001,287,0002,117,632
6May 21, 2026 22:232,92417,436,8766,016,0001,295,0002,117,632
7May 21, 2026 22:232,96619,385,2446,105,0001,310,0002,117,632
8May 21, 2026 22:232,98818,938,1016,149,0001,322,0002,117,632
9May 21, 2026 22:232,99917,947,9246,183,0001,315,0002,117,632