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 listJul 9, 2023 18:30Bernard TeoBernard TeoScore: 31,475Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2023 18:3031,372104,776,83077,425,0001,005,0002,400,256
2Jul 9, 2023 18:3031,404102,589,60178,511,00002,314,240
3Jul 9, 2023 18:3031,422102,529,19578,556,00002,297,856
4Jul 9, 2023 18:3031,432105,079,99478,581,00002,404,352
5Jul 9, 2023 18:3031,448100,643,15478,621,00002,338,816
6Jul 9, 2023 18:3031,454100,049,01378,636,00002,396,160
7Jul 9, 2023 18:3031,475109,198,41477,680,0001,008,0002,338,816
8Jul 9, 2023 18:3031,506100,339,65577,769,000997,0002,330,624
9Jul 9, 2023 18:3031,580108,281,88475,951,0002,998,0002,330,624
10Jul 9, 2023 18:3037,984154,124,62694,960,63602,256,896
11Jul 9, 2023 18:3038,011162,676,27195,026,99902,244,608
12Jul 9, 2023 18:3038,112147,658,45395,280,52102,240,512