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 11:26Yurkov AlekseyYurkov AlekseyScore: 78,008Success
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 11:2667,433610,963,408552,950,66802,293,760
2Jun 13, 2021 11:2678,008713,926,369639,666,17002,203,648
3Jun 13, 2021 11:2685,025751,567,194697,206,23402,285,568