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 12, 2021 20:51Sergey StreminSergey StreminScore: 61,858Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2021 20:5160,286547,016,777494,348,14802,244,608
2Jun 12, 2021 20:5161,858577,213,724507,237,08702,240,512
3Jun 12, 2021 20:5162,843582,691,634515,315,21702,248,704