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 24, 2023 21:58Kenneth MaplesKenneth MaplesScore: 63,450Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 21:5863,159182,738,374148,904,0008,994,0002,326,528
2Dec 24, 2023 21:5863,425189,674,268151,539,0007,024,0002,486,272
3Dec 24, 2023 21:5863,427191,701,088151,542,0007,025,0002,297,856
4Dec 24, 2023 21:5863,432184,609,804147,541,00011,040,0002,482,176
5Dec 24, 2023 21:5863,443183,952,216153,588,0005,019,0002,297,856
6Dec 24, 2023 21:5863,445185,227,764152,589,0006,023,0002,478,080
7Dec 24, 2023 21:5863,450190,896,417146,579,00012,047,0002,478,080
8Dec 24, 2023 21:5863,586189,559,011143,969,00014,996,0002,293,760
9Dec 24, 2023 21:5863,701185,757,969146,232,00013,020,0002,482,176
10Dec 24, 2023 21:5865,396225,533,391163,489,11102,199,552
11Dec 24, 2023 21:5865,427222,734,062163,566,59502,191,360
12Dec 24, 2023 21:5865,496234,051,440163,740,95402,183,168