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 listJun 12, 2024 18:07Nicholas PatrickNicholas PatrickScore: 957,953Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2024 18:07957,2907,905,163,8067,849,778,41402,285,568
2Jun 12, 2024 18:07957,9537,919,926,4367,855,212,95802,297,856
3Jun 12, 2024 18:07965,0527,969,664,6587,913,425,46702,297,856