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 13, 2021 07:51Sergey StreminSergey StreminScore: 19,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2021 07:5218,789214,485,743154,067,91802,310,144
2Jun 13, 2021 07:5118,947221,313,326155,364,42502,310,144
3Jun 13, 2021 07:5219,023225,415,554155,990,08002,306,048
4Jun 13, 2021 07:5119,540214,988,177160,226,78902,322,432
5Jun 13, 2021 07:5219,569219,985,047160,466,30602,318,336
6Jun 13, 2021 07:5120,102233,151,879164,839,66302,191,360