Codeword stabilized (CWS) codes is a general class of quantum codes that includes stabilizer
codes and many families of nonadditive codes with good parameters. Similar to classical nonlinear
codes, a CWS code can be decoded by screening all possible error vectors. For an $n$-qubit quantum
code correcting up to t errors, this brute-force approach consecutively tests different error vectors
of weight t or less, and employs a separate $n$-qubit measurement in each test. To simplify decoding,
we propose an algorithm that employs a single measurement to process all errors located on a given
cluster of $t$ qubits. Compared to an exhaustive error screening, this reduces about $3^t$ times the total
number of measurements required for error correction.