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 21:26zielajzielajScore: 2,842Success
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 21:172,82545,455,27722,159,0001,007,0002,371,584
2Apr 15, 2026 21:172,83744,126,27122,252,0001,011,0002,408,448
3Apr 15, 2026 21:272,83849,967,40322,260,0001,011,0002,342,912
4Apr 15, 2026 21:272,84048,188,16521,266,0002,025,0002,314,240
5Apr 15, 2026 21:262,84247,850,35323,307,00002,400,256
6Apr 15, 2026 21:262,85448,588,92322,383,0001,017,0002,293,760
7Apr 15, 2026 21:275,44070,501,50543,591,0001,013,0002,424,832
8Apr 15, 2026 21:265,46473,544,09643,813,000995,0002,310,144
9Apr 15, 2026 21:175,46670,340,40342,832,0001,992,0002,367,488