Python Algorithm with eBay APIs

I have an existing python algorithm that needs to be optimized. It deals with eBay APIs and it collects ISBNs from eBay and uploads it onto a CSV file. The algorithm I have is a good framework, but I need it to work faster, more efficiently, and add more filters to it. Filters that are currently included in the algorithm are filters that are on eBay under the textbook domain (ex. price, condition-very good, etc., listing type). The filter "publication year" needs to be implemented only including books with a publication year from "2011-now". It needs to collect the title of the listing as well to have it in the CSV file. I am only looking for standard edition books, and while this is not always written on eBay, I need to omit international versions, teachers editions, and global editions. A big issue with the current algorithm is that when I search 10k multiple times, I have many repeats that are coming up with each search. There cannot be any repeats. The entire algorithm also needs to run much more quickly. Filters that need to be able to turned on or off include: free shipping/shipping price, max/min price, subject, listing type, and condition. If the listing is a bid instead of buy it now, it needs to collect how much time is left in the bid for that specific book. The books need to be sorted by "best match, anding soonest, newly listed, nearest first". I will send you the current algorithm through chat, and if you believe it needs to be completely redone, that is fine. I need an end product that will be absolutely efficient and give me the output I'm looking for. The first three images show the filters as seen on the eBay site for textbooks. The next picture is a sample of the CSV file I currently get outputted from the algorithm with the ISBN, link, and price. Again, please message me through chat for the algorithm itself. I have been working on this for a few weeks, and I need a freelancer that is absolutely confident in their abilities to implement every feature that I am asking for, and any other way to optimize the algorithm to make it the most efficient and run faster with no repeats. This project needs to be done as soon as possible, preferably within the next few days. Please chat me if you have any questions.