Fast algorithm for finding out if a string contains any string in a given array

Question

I have a list of about 50 keywords and about 50000 strings. I check every string if it contains at least one of the keywords. I'm not interested in the matched keyword or the number of matched keywords. I only want a "true" or "false" back, as fast as possible.

So, I bet there's an algorithm out there that outperforms my current LINQ version by far:

class MyEnumerableExtension
{
    public static bool ContainsAny(this string searchString, IEnumerable<string> keywords)
    {
        return keywords.Any(keyword => searchString.Contains(keyword))
    }
}

bool foundAny = "abcdef".ContainsAny(new string[] { "ac", "bd", "cd" } );

Answer 1

isn't this in essence the same as your other question of today Efficient algorithm for finding all keywords in a text except modified to return once a match has been found?