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 23:43emily graceemily graceScore: 186,383Success
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 23:43182,4674,554,793,8451,496,229,32002,252,800
2Mar 27, 2024 23:43186,3835,244,285,0341,528,337,97002,265,088
3Mar 27, 2024 23:43206,4965,824,089,3051,693,263,59202,260,992