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 listJul 21, 2021 15:11Mikhail ShirokovMikhail ShirokovScore: 976,151Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2021 15:11970,6838,018,818,3707,959,601,75502,301,952
2Jul 21, 2021 15:11976,1518,066,868,7438,004,438,87002,301,952
3Jul 21, 2021 15:11978,2638,084,856,8408,021,760,14302,301,952