Preempting stack/heap collisions

In the case of a greeter that keeps a list of whom it's greeted to avoid repetitiousness, it will at some point run out of memory, so it becomes necessary to remove the oldest names when adding new ones.

Is there any way of predetermining if just one more waffer-thin name will break the script? Or should one run an experiment to try to determine the maximum number of 36-character names it can store and hard-code that into the script?

I'd go with the experiment as there isn't any other reliable way. It will be quite a few entries if you are using MONO

You can also prolong life by storing something less than the full name or key. I typically save the final 8 digits of an av's key, figuring that the probability of getting duplicate hits is low enough that it's not worth a major worry. Unless you need the full name itself for another reason, I think you can avoid repetition by saving something a lot shorter.

Maybe you could adapt this script: ..

I went simple with mine. I keep the list of names only, and every 12 hours my greeter posts the list to a php script which then compiles and injects the visit stats into my traffic database and the greeter resets itself.