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 15, 2026 02:08zielajzielajScore: 5,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2026 02:082,79346,671,28520,914,0001,991,0002,498,560
2Apr 15, 2026 02:082,80643,670,25522,009,0001,000,0002,338,816
3Apr 15, 2026 02:082,81250,550,16821,055,0002,005,0002,510,848
4Apr 15, 2026 02:083,43650,597,10625,155,0003,018,0002,326,528
5Apr 15, 2026 02:085,30574,488,79243,501,00002,293,760
6Apr 15, 2026 02:085,33968,604,23541,791,0001,990,0002,338,816
7Apr 15, 2026 02:085,34172,528,43041,807,0001,990,0002,531,328
8Apr 15, 2026 02:085,36163,768,99741,960,0001,998,0002,498,560
9Apr 15, 2026 02:0811,383122,471,43992,334,0001,003,0002,375,680