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 listApr 24, 2026 03:28olliecrowolliecrowScore: 32,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 03:2831,520271,978,451258,467,00002,334,720
2Apr 24, 2026 03:2831,747278,501,350259,329,0001,001,0002,371,584
3Apr 24, 2026 03:2832,064280,507,333260,929,0001,999,0002,392,064
4Apr 24, 2026 03:2832,361289,399,469264,365,0001,001,0002,392,064
5Apr 24, 2026 03:2832,454283,740,600265,126,0001,000,0002,469,888
6Apr 24, 2026 03:2832,550282,022,784264,917,0001,999,0002,379,776
7Apr 24, 2026 03:2832,595282,220,866266,286,0001,001,0002,338,816
8Apr 24, 2026 03:2832,779283,676,580266,791,0001,998,0002,342,912
9Apr 24, 2026 03:2834,458296,963,331281,561,0001,001,0002,338,816