We consider {\sl external inverse pattern matching} problem. Given a text \t of length n over an ordered alphabet Σ, such that ∣Σ∣=σ, and a number m≤n. The entire problem is to find a pattern \pe\in \Sigma^m which is not a subword of \t and which maximizes the sum of Hamming distances between \pe and all subwords of \t of length m. We present optimal O(nlogσ)-time algorithm for the external inverse pattern matching problem which substantially improves the only known polynomial O(nmlogσ)-time algorithm introduced by Amir, Apostolico and Lewenstein. Moreover we discuss a fast parallel implementation of our algorithm on the CREW PRAM model