Linear search checks items sequentially. For roughly 10,000 accounts, that simple access pattern can finish faster than parallel processing because thread management, coordination, synchronization, and context switching outweigh the search work. section 7.1.3
Treat linear search as a measured baseline rather than an automatic optimization target. Expected traffic and collection size determine whether its simplicity is sufficient or whether an indexed lookup is justified. section 7.1.3
Account lookup benchmark
An AccountFinder benchmark compares linear, parallel, and HashMap-based lookup strategies. With 10,000 accounts, linear search remains extremely fast, while the HashMap approach is orders of magnitude faster after indexing account identifiers. section 7.1.3






