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 22, 2026 09:50M-RochatM-RochatScore: 4,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 09:504,55320,708,18110,292,0001,091,0002,117,632
2May 22, 2026 09:504,55720,667,57510,305,0001,088,0002,121,728
3May 22, 2026 09:504,68420,951,77510,614,0001,097,0002,121,728
4May 22, 2026 09:504,68520,945,27810,618,0001,096,0002,117,632
5May 22, 2026 09:504,68921,588,20810,623,0001,101,0002,117,632
6May 22, 2026 09:504,69421,501,20910,635,0001,100,0002,117,632
7May 22, 2026 09:504,69921,515,38310,649,0001,100,0002,117,632
8May 22, 2026 09:504,70321,419,64610,660,0001,099,0002,117,632
9May 22, 2026 09:504,71321,469,95610,684,0001,100,0002,117,632