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:16Jacob McDanielJacob McDanielScore: 2,690Success
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,67216,715,2405,496,0001,186,0002,117,632
2May 20, 2026 11:172,67416,380,6435,494,0001,191,0002,117,632
3May 20, 2026 11:172,67616,089,0685,503,0001,188,0002,117,632
4May 20, 2026 11:172,68817,982,8475,525,0001,195,0002,117,632
5May 20, 2026 11:172,69016,506,7055,505,0001,222,0002,117,632
6May 20, 2026 11:172,73416,802,4115,559,0001,277,0002,117,632
7May 20, 2026 11:172,74218,325,5265,595,0001,260,0002,117,632
8May 20, 2026 11:172,74317,100,4355,589,0001,270,0002,117,632
9May 20, 2026 11:172,76629,776,4335,645,0001,271,0002,117,632