Concurrent Event Overlap

In this problem, you are given a list of events where each event is represented as a pair of integers [start, end]. Each event starts at the time start and finishes at the time end (with start < end). Your task is to write a function that determines the maximum number of events that are occurring concurrently at any point in time.

Input:

• An array of events, where each event is represented as [start, end]. The array may contain up to 10^5 events.

Output:

• An integer representing the maximum number of concurrent events.

Example 1:

Input: [[10, 20], [15, 25], [20, 30]]
Output: 2

Explanation: From time 15 to 20, there are 2 events overlapping.

Example 2:

Input: [[0, 5], [3, 10], [10, 15]]
Output: 2

Constraints and Considerations:

• The event times are given as positive integers.
• Efficiency is important due to the possible large size of the input array. Consider optimizing your solution for time complexity.

Develop a solution in your preferred language. Please ensure that your code can handle large input sizes efficiently.