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 29, 2024 20:53Drew GarciaDrew GarciaScore: 62,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2024 20:5355,436515,135,444454,578,10302,269,184
2Mar 29, 2024 20:5457,867543,609,396474,509,26202,273,280
3Mar 29, 2024 20:5457,977538,193,961475,410,15302,281,472
4Mar 29, 2024 20:5362,335571,325,326511,147,76902,285,568
5Mar 29, 2024 20:5466,796608,070,364547,729,51402,277,376
6Mar 29, 2024 20:5369,223635,722,479567,631,55402,281,472