Consider the case, for example, of cracking an encryption key; each time you try an incorrect key, you reverse the whole computation. It's only when you hit on the right key that you store a 1 bit indicating success and a copy of the cracked key; then you reverse the last encryption attempt, leaving only the key. Maybe you've done 2¹²⁸ trial encryptions, each requiring 2¹³ bit operations, for a total of 2¹⁴¹ bit operations of reversible computation, but you only need to store 2⁷ bits to get the benefit, a savings of 2¹³⁵×.
Most practical computations don't enjoy quite such a staggering reduction in thermodynamic entropy from reversible computation, but a few orders of magnitude is commonplace.
It sounds like you could benefit from reading an introduction to the field. Though I may be biased, I can recommend Michael Frank's introduction from 20 years ago: https://web1.eng.famu.fsu.edu/~mpf/ip1-Frank.pdf