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 15, 2021 19:18Sergey StreminSergey StreminScore: 14,579Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2021 19:2014,480184,701,495118,736,30102,289,664
2Jun 15, 2021 19:1814,508184,961,656118,967,86802,306,048
3Jun 15, 2021 19:2014,542185,501,623119,245,86002,273,280
4Jun 15, 2021 19:1814,579186,233,387119,549,53302,232,320
5Jun 15, 2021 19:2014,601179,328,778119,728,77302,301,952
6Jun 15, 2021 19:1814,672178,712,106120,312,53602,293,760