data Exhaustive enumeration of all 1,017,038,196 blocks of k>=4 consecutive integers with product <= 10^36 via k-way sorted merge, in two independently written implementations (sweep.py: Python bigints + heapq.merge; sweep.c: unsigned __int128 + hand-rolled binary heap). At 10^18, 10^24, 10^30 and 10^36 both implementations agree exactly on per-length block counts, the order-independent checksum sum(p) mod 2^61-1, and the complete collision list. Positive control: the expected infinite overlapping family (OEIS A064224: 5040, 19958400, 259459200, 20274183401472000, ...) is detected, so the collision detector has failure-power. Reproduce: ./verify.sh (fast) or ./verify.sh full (includes both 10^36 runs, ~8 min). Raw outputs out_c_36.txt/out_py_36.txt; checksum at 10^36: 349154945598101266.