The user lookup endpoint previously used a linear scan over the user list, which degraded performance under high concurrency. This change replaces the search algorithm with a binary search on the sorted user ID array, reducing average lookup time from O(n) to O(log n). The user list is maintained in sorted order via insertion sort on new user registration.