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 12, 2023 22:41Yuriy LyfenkoYuriy LyfenkoScore: 61,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2023 22:4161,674179,045,092145,175,0009,010,0002,318,336
2Jul 12, 2023 22:4161,680180,317,318143,186,00011,014,0002,334,720
3Jul 12, 2023 22:4161,706186,666,663145,251,0009,015,0002,326,528
4Jul 12, 2023 22:4161,730182,098,160144,305,00010,021,0002,371,584
5Jul 12, 2023 22:4161,742200,658,255154,354,98702,297,856
6Jul 12, 2023 22:4161,750182,737,697146,357,0008,019,0002,433,024
7Jul 12, 2023 22:4161,790185,568,810148,458,0006,018,0002,367,488
8Jul 12, 2023 22:4161,816179,658,602143,501,00011,038,0002,486,272
9Jul 12, 2023 22:4161,894212,912,094154,735,89502,297,856
10Jul 12, 2023 22:4162,036180,051,101146,085,0009,005,0002,330,624
11Jul 12, 2023 22:4162,292211,953,773155,729,62002,306,048
12Jul 12, 2023 22:4162,728182,068,244146,833,0009,988,0002,498,560