The solution exposed don't seems competitive enough to solve with good rank the problem exposed here https://highload.fun/tasks/14
That site is really good to play with SIMD code.
That site is really good to play with SIMD code.
Frequently we end up with solutions that use tricks that would not be applicable to the n=1 problem in TFA ("parse 1 timestamp") when we try to get the fastest solutions for "find the sum of all these timestamps."