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 16, 2026 23:12M-RochatM-RochatScore: 4,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 23:124,47919,814,73110,094,0001,105,0002,117,632
2May 16, 2026 23:124,48019,768,95410,111,0001,091,0002,117,632
3May 16, 2026 23:124,49619,844,30610,147,0001,094,0002,117,632
4May 16, 2026 23:124,50319,936,89610,166,0001,092,0002,117,632
5May 16, 2026 23:124,50820,712,82110,179,0001,093,0002,117,632
6May 16, 2026 23:124,50922,747,31810,180,0001,094,0002,117,632
7May 16, 2026 23:124,51619,886,29810,195,0001,095,0002,117,632
8May 16, 2026 23:124,51819,911,70710,199,0001,096,0002,117,632
9May 16, 2026 23:124,52619,828,19010,219,0001,096,0002,121,728