cache size

I'm trying to write a program in C that spits out data that I can use to find the size of my L1 cache (theoretical experiment, I know I can just look it up). It isn't working, though.

Basically what I'm doing is I'm allocating arrays of incrementally larger sizes, filling them with random numbers, and then accessing each of the elements in the array, in order, 10,000 times in a row, and timing how long that takes. The concept is that once the array is larger than my L1 cache size, the average access time should suddenly jump higher. However, I'm not seeing this and am getting a constant increase in access time from array size 1K to 4MB. (my actual L1 cache size is 64K).

Anyone care to point out where I'm fucking up?

>>10
Yeah, sure, we know, x86 sucks, all modern software is bloated and sucks, not the least because it is written in languages that suck, bla bla bla, '78 LISP processor prototype was way cooler than this shit and had no fucking cache -- lrning2cache is hard, let's read SICP!

Too bad jews killed the project and suppressed all research in that direction ever since because it jeopardized the new consumerist world order.