he Erdős-Ginzburg-Ziv theorem states that for any sequence of 2n-1 integers, there exists a subsequence of n elements whose sum is divisible by n. In this article, we provide a simple, practical O(nlog log n) algorithm and a theoretical O(nlog log log n) algorithm, both of which improve upon the best previously known O(nlog n) approach. This shows that a specific variant of boolean convolution can be implemented in time faster than the usual O(nlog n) expected from FFT-based methods.
