If there a data structures likes container/queue, based on time , I could use it this way: add item(may duplicate) into it one by one, pop out those added time ealier then 60 minutes; count the queue; then I got top 10 most added items, in a dymatice period, said, 60min.
How to implement this time based container ?
You can do something like this:

Start timer 60 minutes
Get the pages that people visits
Save pages
If timer is not ended do step 2-3 again if timed is ended:
Count wich one is the most visited
Count wich one is the second most visited
Etc
python, data structures, algorithm: how to rank top 10 most visited pages in latest 60 minutes?