[Hard] Longest Valid Bracket Pattern

Given some assortment of brackets, you must find the largest substring that is a valid matching bracket pattern

A bracket match is an opening and closing version of the same kind of bracket beside each other ()
If a bracket matches then outer brackets can also match (())
The valid brackets are ()[]{}

For example for the input {([])()[(])}()] the answer would be ([])() as that is the largest substring that has all matches

You must accept the input as a command line argument (entered when your app is ran) and print out the result

(It will be called like node main.js [(]() or however else to run apps in your language)

You can use the solution tester in this post to test you followed the correct format https://programming.dev/post/1805174

Any programming language may be used. 3 points will be given if you pass all the test cases with 1 bonus point going to whoevers performs the quickest and 1 for whoever can get the least amount of characters

To submit put the code and the language you used below

People who completed the challenge:

@[email protected] - 6.64s - 1203 chars (rust)
@[email protected] - 0.148s - 1251 chars (python)
@[email protected] - 0.008s - 1268 chars (python)
@[email protected] - 0.001s - 1516 chars (c) (fastest)
@[email protected] 0.031s - 317 chars (javascript) (shortest)

submissions open for another day (since the last time I edited the post)