You need 2^65 operations so this is likely not what happened. What you're thinking about is the birthday attack that only works to find collisions and not to find a specific "pre-image"
https://en.wikipedia.org/wiki/Pollard%27s_rho_algorithm_for_...
Here is a trivial one:
In advance, make a table of all the pubkeys xG for secret key s = (0,2^33].
When you get a target key T, compute T - (2^33)xG for x = (0,2^33] and look up the result in the table.
When you get a hit, you've found the private key for T it's (2^33)x + s.
Of course, this is a trivialized example, many optimizations are possible and you can specialize any generic DL solver to work in a known range.
Work thought it, I think it'll be more informative than me simply repeating myself further. If you're still confused, ask specific questions and I'll be glad to answer.