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:52Dmitry DolgopolovDmitry DolgopolovScore: 104,739Success
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:5285,312760,843,067699,558,80602,277,376
2Jun 12, 2021 08:52104,739920,772,536858,857,67602,277,376
3Jun 12, 2021 08:52106,599933,054,991874,109,09402,285,568