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, 2021 08:56Dmitry DolgopolovDmitry DolgopolovScore: 107,139Success
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, 2021 08:56103,395903,223,273847,838,02602,289,664
2Jun 12, 2021 08:56107,139943,912,276878,543,54202,293,760
3Jun 12, 2021 08:56119,4181,041,622,006979,228,75802,285,568