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 15:59Sergey StreminSergey StreminScore: 19,831Success
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 15:5919,810223,471,019162,442,25202,301,952
2Jun 13, 2021 15:5919,831240,124,093162,614,60002,195,456
3Jun 13, 2021 15:5919,893227,244,515163,126,42202,301,952