The study of discrete statistics has a long history and many connections to numerous areas of mathematics. In this talk, we introduce discrete statistics such as descents, ascents, peaks, and pinnacles of permutations and provide a sample of known results. We then focus on a superset of permutations called parking functions, give a summary of what is known about their discrete statistics, and provide open problems for us to explore.