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 listAug 31, 2024 08:54matsuoka-601matsuoka-601Score: 3,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2024 08:543,77631,118,3327,342,0002,097,0002,306,048
2Dec 12, 2024 17:513,80227,779,5067,392,0002,112,0002,293,760
3Aug 31, 2024 08:543,81024,417,6476,350,0003,175,0002,301,952
4Dec 12, 2024 17:513,81125,564,0005,293,0004,235,0002,297,856
5Dec 12, 2024 17:513,81627,002,6415,300,0004,240,0002,494,464
6Aug 31, 2024 08:543,82628,366,0946,376,0003,188,0002,301,952
7Aug 31, 2024 08:543,84426,279,0836,406,0003,203,0002,293,760
8Dec 12, 2024 17:513,85126,793,7865,348,0004,279,0002,301,952
9Aug 31, 2024 08:543,85930,641,3047,504,0002,144,0002,293,760
10Aug 31, 2024 08:543,86323,086,3375,366,0004,292,0002,285,568
11Dec 12, 2024 17:513,88425,923,0675,395,0004,316,0002,293,760
12Aug 31, 2024 08:543,94926,149,1934,936,0004,936,0002,293,760
13Dec 12, 2024 17:513,95923,019,8954,949,0004,949,0002,338,816
14Dec 12, 2024 17:513,96029,872,5536,931,0002,970,0002,498,560
15Aug 31, 2024 08:543,96027,799,8174,950,0004,950,0002,293,760
16Aug 31, 2024 08:543,96331,842,8724,954,0004,954,0002,428,928
17Dec 12, 2024 17:514,01729,855,3227,030,0003,013,0002,293,760
18Aug 31, 2024 08:544,02426,692,1948,049,0002,012,0002,297,856
19Aug 31, 2024 08:544,06826,337,3558,137,0002,034,0002,437,120
20Aug 31, 2024 08:544,09224,693,1816,138,0004,092,0002,293,760
21Dec 12, 2024 17:514,37526,712,0357,955,0002,983,0002,293,760