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 22:59gchebanovgchebanovScore: 33,678Success
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 22:5932,475166,013,58581,186,33702,256,896
2Jul 9, 2023 22:5932,937136,944,81582,342,38502,260,992
3Jul 9, 2023 22:5933,164160,217,77082,911,12002,260,992
4Jul 9, 2023 22:5933,290110,064,43271,193,00012,032,0002,510,848
5Jul 9, 2023 22:5933,515109,986,87773,814,0009,974,0002,273,280
6Jul 9, 2023 22:5933,658106,376,50374,127,00010,017,0002,318,336
7Jul 9, 2023 22:5933,678108,075,22974,173,00010,023,0002,277,376
8Jul 9, 2023 22:5933,836116,948,82476,534,0008,056,0002,285,568
9Jul 9, 2023 22:5934,209109,197,60279,486,0006,036,0002,408,448
10Jul 9, 2023 22:5934,330115,457,45677,842,0007,983,0002,514,944
11Jul 9, 2023 22:5934,579123,733,38679,412,0007,036,0002,494,464
12Jul 9, 2023 22:5934,918115,413,48680,273,0007,023,0002,273,280