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 listSep 28, 2023 13:48apuxbtapuxbtScore: 122,915Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 13:48105,571925,107,539865,682,51802,260,992
2Sep 28, 2023 13:48122,9151,071,609,9571,007,898,99602,265,088
3Sep 28, 2023 13:48122,9401,081,526,1331,008,104,35802,277,376