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 5, 2022 11:19Eugene ZhydzetskiEugene ZhydzetskiScore: 21,958Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2022 10:5321,660261,410,667177,614,88802,195,456
2Sep 5, 2022 11:1921,741242,025,273178,278,14502,187,264
3Sep 5, 2022 11:2821,905252,487,359179,623,38902,195,456
4Sep 5, 2022 10:5321,931249,663,150179,831,65502,183,168
5Sep 5, 2022 11:2821,958237,196,179180,058,12902,191,360
6Sep 5, 2022 11:1922,032241,263,429180,660,56502,187,264
7Sep 5, 2022 11:1922,137247,368,528181,519,67702,191,360
8Sep 5, 2022 11:2822,237234,131,850182,346,39602,187,264
9Sep 5, 2022 10:5322,848265,110,695187,355,34702,187,264