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 19, 2021 10:03Dmitry DolgopolovDmitry DolgopolovScore: 160,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2021 10:0482,0792,388,087,487673,044,60002,248,704
2Jun 19, 2021 10:0582,8391,645,999,419679,277,64002,228,224
3Jun 19, 2021 10:0384,5352,759,832,418693,189,86802,338,816
4Jun 19, 2021 10:0498,1843,390,928,931805,105,67405,464,064
5Jun 19, 2021 10:05160,2093,730,747,2101,313,714,12802,285,568
6Jun 19, 2021 10:03174,0565,526,754,8311,427,257,03405,128,192
7Jun 19, 2021 10:04176,8545,211,367,9031,450,202,43003,399,680
8Jun 19, 2021 10:03194,7895,238,112,2691,597,270,59604,382,720
9Jun 19, 2021 10:05266,7977,616,391,2412,187,738,54903,940,352