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 23:20gchebanovgchebanovScore: 18,432Success
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 23:2014,737102,233,32336,842,78602,265,088
2Jul 9, 2023 23:2014,856107,384,60937,140,92902,265,088
3Jul 9, 2023 23:2015,573108,083,69738,932,89502,269,184
4Jul 9, 2023 23:2017,95669,383,74238,906,0005,985,0002,273,280
5Jul 9, 2023 23:2017,98671,337,56037,971,0006,994,0002,273,280
6Jul 9, 2023 23:2018,00772,821,47940,016,0005,002,0002,404,352
7Jul 9, 2023 23:2018,43275,282,34839,069,0007,012,0002,453,504
8Jul 9, 2023 23:2018,58974,366,76239,401,0007,072,0002,420,736
9Jul 9, 2023 23:2018,62872,323,38739,484,0007,086,0002,490,368
10Jul 9, 2023 23:2018,73676,839,53539,864,0006,976,0002,523,136
11Jul 9, 2023 23:2018,84569,456,61236,087,00011,026,0002,510,848
12Jul 9, 2023 23:2018,88473,561,36141,184,0006,026,0002,519,040