In this work, we consider distributed agreement tasks in microbial distributed systems under stochastic population dynamics and competitive interactions. We examine how competitive exclusion can be used to solve distributed agreement tasks in the microbial setting. To this end, we develop a new technique for analyzing the time to reach competitive exclusion in systems with several competing species under biologically realistic population dynamics. We use this technique to analyze a protocol that exploits competitive interactions to solve approximate majority consensus efficiently in synthetic microbial systems. We show that direct competition dynamics reach majority consensus with high probability when the initial gap between the species is small, i.e., Ω(√ n log n), where n is the initial population size of the majority species. In contrast, we show that indirect competition alone is not efficient: for example, solving majority consensus with high probability requires an initial gap of Ω(n). To corroborate our analytical results, we use computer simulations to show that these consensus dynamics occur within practical time scales.