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 listMar 27, 2024 20:06emily graceemily graceScore: 119,158Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2024 20:06111,581987,276,113914,960,42202,297,856
2Mar 27, 2024 20:06119,1581,039,667,100977,094,29102,179,072
3Mar 27, 2024 20:06147,3871,281,107,6801,208,569,96902,301,952