Per entry overhead with list?

I read someplace that there is a certain memory overhead for storing each item in a list. One place said that there is a 40 byte overhead per string entry in a list but that doesn't make sense to me from my experience. E.g. I'm storying 350 strings of 25 characters each in a list. A 40 byte overhead per item would amount to 14000 for that alone. Also I'm not sure of the bytes per char in lsl. Is it one or two?

I'm trying to come up with a formula that express the memory requirement to hold a list of strings. Anybody have any experience with this?

See . Note, however, that the data on this page depends on plotting the return values of llGetFreeMemory, so I'm not entirely sure how accurate they are.

Thanks. That's a great resource. I'm surprised (or not) that the Lindens have not publicized that information!