Less computationally intensive way of finding multiple curve intersects

Hello, I am trying to remove all curves that are intersecting with one another in this and so far, the component Collison Many|Many does what I want it to. However it takes an incredible amount of time to process due to the amount of curves I want to input into the code. Is there a way to do the same thing but in a more efficient manner and takes less time?

This is part of a larger piece of code that I have segmented out to make it less computationally heavy. The projection is to make visualing the design afterwards easier.
221003_screen_design_v2_draft3.gh (1.1 MB)