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 listFeb 28, 2023 22:38Franek KortaFranek KortaScore: 963,177Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2023 22:39958,5767,924,179,7147,860,321,13102,289,664
2Feb 28, 2023 22:38959,0647,923,307,9827,864,326,44202,281,472
3Feb 28, 2023 22:39961,5407,940,596,1937,884,630,41502,289,664
4Feb 28, 2023 22:38963,1777,964,397,4717,898,049,33102,277,376
5Feb 28, 2023 22:39970,8648,039,157,4857,961,087,76302,289,664
6Feb 28, 2023 22:38971,0218,022,453,5507,962,369,07402,293,760