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 22:47Jacob McDanielJacob McDanielScore: 2,937Success
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 22:472,88917,774,7516,090,0001,134,0002,117,632
2May 17, 2026 22:472,89416,487,3126,117,0001,119,0002,117,632
3May 17, 2026 22:472,90819,359,5096,089,0001,181,0002,117,632
4May 17, 2026 22:472,93218,804,1296,113,0001,218,0002,117,632
5May 17, 2026 22:472,93719,542,1186,127,0001,217,0002,117,632
6May 17, 2026 22:472,96016,770,4066,147,0001,254,0002,117,632
7May 17, 2026 22:472,97918,550,2566,190,0001,259,0002,117,632
8May 17, 2026 22:472,98818,054,3406,208,0001,263,0002,117,632
9May 17, 2026 22:473,05617,405,5996,373,0001,269,0002,117,632