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 listJul 4, 2021 00:55Egor SergeevEgor SergeevScore: 107,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2021 00:5594,215835,870,094772,566,82602,273,280
2Jul 4, 2021 00:55107,560943,113,531881,993,42802,301,952
3Jul 4, 2021 00:55117,5701,031,306,853964,075,22702,236,416