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 listDec 22, 2024 23:39HighloadGPTO1HighloadGPTO1Score: 349,082Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2024 23:39348,948897,657,314870,373,0001,998,0002,490,368
2Dec 22, 2024 23:39348,956900,054,911870,391,0001,998,0002,277,376
3Dec 22, 2024 23:39349,055892,574,297871,639,000999,0002,420,736
4Dec 22, 2024 23:39349,072898,279,208870,682,0001,999,0002,486,272
5Dec 22, 2024 23:39349,082898,340,604870,707,0001,999,0002,482,176
6Dec 22, 2024 23:39349,116899,976,004870,791,0001,999,0002,490,368
7Dec 22, 2024 23:39349,131902,301,890871,828,000999,0002,482,176
8Dec 22, 2024 23:39349,145905,073,292871,863,000999,0002,486,272
9Dec 22, 2024 23:39349,163895,269,741871,909,000999,0002,277,376