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 14, 2023 00:57Paul MasurelPaul MasurelScore: 18,395Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2023 00:5718,170213,158,228148,991,13202,211,840
2Jul 14, 2023 00:5818,355221,747,850150,511,27302,318,336
3Jul 14, 2023 00:5818,369220,310,648150,624,98302,265,088
4Jul 14, 2023 00:5718,379223,892,701150,710,30702,211,840
5Jul 14, 2023 00:5718,395231,735,419150,836,17602,220,032
6Jul 14, 2023 00:5718,489242,808,930151,611,76102,318,336
7Jul 14, 2023 00:5718,490214,207,279151,614,41402,228,224
8Jul 14, 2023 00:5818,501217,539,306151,707,01202,256,896
9Jul 14, 2023 00:5718,836219,609,287154,457,08802,199,552