Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listJan 26, 2024 20:46Jonathan Allen GrantJonathan Allen GrantScore: 956,984Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 26, 2024 20:46955,2877,893,620,3347,833,352,94102,297,856
2Jan 26, 2024 20:46956,9847,913,240,8907,847,270,71002,293,760
3Jan 26, 2024 20:46960,1957,936,932,2987,873,597,43602,289,664