We derive new time-space tradeoff lower bounds and algorithms for exactly computing statistics of input data, including frequency moments, element distinctness, and order statistics, that are simple to calculate for sorted data. In particular, we develop a randomized algorithm for the element distinctness problem whose time T and space S satisfy TO(n32S12) , smaller than previous lower bounds for comparison-based algorithms, showing that element distinctness is strictly easier than sorting for randomized branching programs. This algorithm is based on a new time- and space-efficient algorithm for finding all collisions of a function f from a finite set to itself that are reachable by iterating f from a given set of starting points.We further show that our element distinctness algorithm can be extended at only a polylogarithmic factor cost to solve the element distinctness problem over sliding windows, where the task is to take an input of length 2n−1 and produce an output for each window of length n, giving n outputs in total.In contrast, we show a time-space tradeoff lower bound of T(n2S) for randomized multi-way branching programs, and hence standard RAM and word-RAM models, to compute the number of distinct elements, F0, over sliding windows. The same lower bound holds for computing the low-order bit of F0 and computing any frequency moment Fk for k=1 . This shows that frequency moments Fk=1 and even the decision problem F0mod2 are strictly harder than element distinctness. We provide even stronger separations on average for inputs from [n].We complement this lower bound with a TO(n2S) comparison-based deterministic RAM algorithm for exactly computing Fk over sliding windows, nearly matching both our general lower bound for the sliding-window version and the comparison-based lower bounds for a single instance of the problem. We further exhibit a quantum algorithm for F0 over sliding windows with TO(n32S12) .Finally, we consider the computations of order statistics over sliding windows.