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 listMay 10, 2023 23:12Martin StensgårdMartin StensgårdError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2023 23:1100000Error: No answer to stdout. Died or killed?
2May 10, 2023 23:12112,253984,094,923920,475,62602,289,664
3May 10, 2023 23:12113,614987,923,796931,635,78902,195,456
4May 10, 2023 23:12120,9261,066,590,324991,591,60402,191,360