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:54Kenneth MaplesKenneth MaplesScore: 74,930Success
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:5474,165248,401,905185,413,25102,211,840
2Dec 24, 2023 21:5474,167255,293,525185,417,92302,215,936
3Dec 24, 2023 21:5474,196247,611,660185,490,53902,203,648
4Dec 24, 2023 21:5474,842212,613,387180,102,0007,004,0002,367,488
5Dec 24, 2023 21:5474,894212,238,159179,226,0008,010,0002,310,144
6Dec 24, 2023 21:5474,911209,283,912178,264,0009,013,0002,367,488
7Dec 24, 2023 21:5474,930209,921,619177,308,00010,017,0002,457,600
8Dec 24, 2023 21:5474,986208,306,502176,437,00011,027,0002,359,296
9Dec 24, 2023 21:5475,012218,259,788176,499,00011,031,0002,314,240
10Dec 24, 2023 21:5475,012217,218,876177,502,00010,028,0002,367,488
11Dec 24, 2023 21:5475,045214,168,448176,577,00011,036,0002,363,392
12Dec 24, 2023 21:5475,359211,796,356177,375,00011,023,0002,359,296