One line, and 5-10 times slower. This solution is relatively fast

['D', 'u', 'd', 'e', ','],
[' ', 'W', 'h', 'e', 'r'],
['e', '\'', 's', ' ', 'M'],
['y', ' ', 'C', 'a', 'r' /*?*/]

Excellent solution. Fastest one yet!

Not really. This solution is very slow because of excessive Linq.

Excellent solution. Finally see someone else who stored the sum of each number in an array. Interesting take on calculating scores using modulus.

Not sure what you're talking about re: efficiency. OP's code is very efficient...nearly as fast as my own. Yours, however, is extremely inefficient. OP's code outpaces your own 18:1.

Great solution, very fast.

Best comment ever 😂

Surprisingly, nope

I copied this solution to VS Code so I could benchmark it...Crashed VS Code 🤪

Restarted, recopied, benchmarked...slow, even with the hardcoding 🙄

Using a dictionary would be slower than using a simple int array as OP has done. You're adding more overhead/complexity and probably memory usage as well by using a dictionary.

OP's solution is exceedingly fast (see my comment about his error, though). Even much faster than my own (using a short str1 input...really long ones, my code is much faster), which is faster than all of the other solutions posted here that I've tested.

Per kata author's instructions, only lower case letters will be provided. Which means zero non-letters, whitespace, digits, null/empty strings.