If you populate a B-tree style file, the performance on inserts quickly degrades with the number of records already inserted. Try measuring the insert performance as function of the number of records in the file. Using the hash variant that Berkeley DB supports should give you much better performance.

Another option is to try profiling your script. That should provide an indication of where the bottleneck is.