News for hackers. Stuff that matters.
Re:How we store 400M phone numbers with fast lookup by IanCal on Monday July 20, 2015 @10:19AM (#9916177)
Absolute laziest approach, 10 billion numbers entries laid out sequentially. At 2 bytes for each entry, that's only 20GB. That's less than I can fit in some fairly cheap consumer box.

Would that work? Just an array in C. Or are there interesting performance problems I'd be likely to run into?

There are no comments on this comment yet.