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 21:34Jonathan Allen GrantJonathan Allen GrantScore: 961,680Success
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 21:34958,4947,926,202,0367,859,649,48502,289,664
2Jan 26, 2024 21:34961,6807,953,361,9267,885,772,83302,285,568
3Jan 26, 2024 21:34963,5617,963,271,8847,901,198,03102,289,664