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 listJan 10, 2023 05:19Victor MuñozVictor MuñozScore: 31,885Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2023 05:1931,185321,255,651255,718,28402,248,704
2Jan 10, 2023 05:2031,369318,342,411257,228,83802,248,704
3Jan 10, 2023 05:2031,866320,095,908261,301,23202,244,608
4Jan 10, 2023 05:1931,885320,137,657261,458,32802,248,704
5Jan 10, 2023 05:2032,456325,373,084266,141,55902,240,512
6Jan 10, 2023 05:1932,505343,199,978266,541,27702,240,512