Jeremy Zerfas

> It is possible to allow any algorithm and even make the code validation process almost automatic. However, a stronger test needs to be created since many problems can easily...

> > @[JZerf](https://github.com/JZerf) Over the long run, people will determine optimal algorithms to solve the problems and those optimal algorithms will be adopted by most of the programs anyway. >...

> This may also mean introducing a new algorithm for a particular language will make its number uncomparable to others until they catch up in 2 and a half years...

> Only when a program is using its standard library, FFI bindings are allowed. The third-party libraries I choose are all lang-native implementations. I hadn't noticed that nearly all the...

> > it might not be a good idea to have problems that will typically be heavily dependent on libraries to do much of the work. > > Please note...

> > What I'm not OK with is problems like the pidigits problem where often 90+% of the time is spent in arbitrary precision math libraries or the regex-redux problem...

> when ppl are making choices from many langs, do they take standard or most popular libraries into consideration. It depends. I know many Python and Java developers love how...

> How about if your program is using better algorithm and running much faster? That only means that you are a better programmer and the same applies if you are...

> Could you please have a look at the 3.cpp nsieve code sitting in my unaccepted PR and speed it up by at least 25% using standard library only to...

> No matter how nicely or what I ask about or for I don't get any kind of reply or action for something like 7 days. Not even a yes...