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 15:43Sergey StreminSergey StreminScore: 46,316Success
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 15:4346,310444,245,513379,745,71602,187,264
2Jun 12, 2021 15:4346,316447,133,427379,792,05002,187,264
3Jun 12, 2021 15:4346,326443,103,470379,869,38302,195,456