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:01Jacob McDanielJacob McDanielScore: 2,757Success
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:022,74317,040,7505,686,0001,172,0002,117,632
2May 20, 2026 11:022,74816,758,4625,699,0001,172,0002,117,632
3May 20, 2026 11:022,74817,083,2115,690,0001,181,0002,117,632
4May 20, 2026 11:022,75019,360,3015,695,0001,180,0002,117,632
5May 20, 2026 11:022,75717,014,2165,709,0001,184,0002,117,632
6May 20, 2026 11:022,81118,716,0125,754,0001,275,0002,117,632
7May 20, 2026 11:022,84916,980,2105,865,0001,258,0002,117,632
8May 20, 2026 11:022,92331,486,0496,087,0001,221,0002,117,632
9May 20, 2026 11:023,20230,490,4126,881,0001,126,0002,117,632