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 13, 2021 15:17Yurkov AlekseyYurkov AlekseyScore: 82,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2021 15:1667,804612,203,811555,993,22102,297,856
2Jun 13, 2021 15:1769,282631,290,590568,114,19202,293,760
3Jun 13, 2021 15:1682,190738,763,576673,954,92802,293,760
4Jun 13, 2021 15:1782,622739,231,690677,500,13402,289,664
5Jun 13, 2021 15:1792,812826,743,766761,061,37502,293,760
6Jun 13, 2021 15:16118,1991,032,946,986969,234,00802,301,952