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 listApr 13, 2026 11:45limanjun99limanjun99Score: 3,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 08:533,07427,339,8505,489,0002,195,0002,293,760
2Apr 13, 2026 11:443,08224,957,9755,503,0002,201,0002,527,232
3Apr 13, 2026 08:533,09226,555,3016,627,0001,104,0002,265,088
4Apr 13, 2026 08:533,10023,375,9305,535,0002,214,0002,293,760
5Apr 13, 2026 08:533,10422,463,0605,543,0002,217,0002,277,376
6Apr 13, 2026 08:533,10631,169,9196,655,0001,109,0002,285,568
7Apr 13, 2026 11:443,10629,373,1435,547,0002,219,0002,293,760
8Apr 13, 2026 11:453,10825,928,0225,551,0002,220,0002,523,136
9Apr 13, 2026 08:533,11026,631,5375,554,0002,221,0002,293,760
10Apr 13, 2026 08:533,16625,317,6045,936,0001,978,0002,531,328
11Apr 13, 2026 11:453,16624,486,5674,948,0002,968,0002,273,280
12Apr 13, 2026 08:533,19725,143,8864,995,0002,997,0002,285,568
13Apr 13, 2026 11:443,21626,928,6195,025,0003,015,0002,293,760
14Apr 13, 2026 11:453,23024,195,5295,046,0003,028,0002,527,232
15Apr 13, 2026 08:533,24527,886,4505,070,0003,042,0002,527,232