The baby-step giant-step method works by using a hash table to trade space for time. It's particularly easy to implement since python has hash tables nicely built in as dictionaries.

>>> crack_baby_giant(C, P, n, Q)
Priv key: d = 692847
Time: 0.356 secs

https://github.com/qubd/mini_ecdsa