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 17, 2026 18:46Jacob McDanielJacob McDanielScore: 3,120Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 18:463,07618,763,8906,579,0001,111,0002,117,632
2May 17, 2026 18:463,08720,005,7746,551,0001,167,0002,117,632
3May 17, 2026 18:463,10718,583,3886,586,0001,182,0002,117,632
4May 17, 2026 18:463,11718,702,8906,603,0001,190,0002,117,632
5May 17, 2026 18:463,12018,647,1126,642,0001,158,0002,117,632
6May 17, 2026 18:463,12119,934,2906,579,0001,224,0002,117,632
7May 17, 2026 18:463,13518,763,1746,608,0001,231,0002,117,632
8May 17, 2026 18:463,13818,357,4236,614,0001,232,0002,117,632
9May 17, 2026 18:463,15820,001,6816,643,0001,253,0002,117,632