A permutation of length n is called a flattened partition if the leading terms of maximal chains of ascents (called runs) are in increasing order. We analogously define flattened parking functions: a subset of parking functions for which the leading terms of maximal chains of weak ascents (also called runs) are in weakly increasing order. For n ≤ 8, where there are at most four runs, we give data for the number of flattened parking functions, and it remains an open problem to give formulas for their enumeration in general. We then specialize to a subset of flattened parking functions that we call 𝒮-insertion flattened parking functions. These are obtained by inserting all numbers of a multiset 𝒮 whose elements are in [n] = {1, 2, ... , n}, into a permutation of [n] and checking that the result is flattened. We provide bijections between 𝒮-insertion flattened parking functions and 𝒮′-insertion flattened parking functions, where 𝒮 and 𝒮′ have certain relations. We then further specialize to the case 𝒮 = 1_r, the multiset with r ones, and we establish a bijection between 1_r-insertion flattened parking functions and set partitions of [n + r] with the first r integers in different subsets.