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 listAug 4, 2021 12:12Mikhail ShirokovMikhail ShirokovScore: 21,936Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2021 12:1221,737261,072,706178,245,74702,301,952
2Aug 4, 2021 12:1221,936238,706,296179,877,36802,244,608
3Aug 4, 2021 12:1222,134248,421,385181,501,19602,240,512