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 listMar 17, 2026 14:25limanjun99limanjun99Score: 41,788Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 14:2538,838343,202,637313,463,0005,007,0002,293,760
2Mar 17, 2026 14:2541,119359,753,149333,175,0004,002,0002,494,464
3Mar 17, 2026 14:2541,414364,894,566329,607,0009,988,0002,269,184
4Mar 17, 2026 14:2541,743363,156,184338,289,0004,003,0002,453,504
5Mar 17, 2026 14:2541,788371,051,802338,669,0003,996,0002,326,528
6Mar 17, 2026 14:2541,857363,146,273339,227,0004,002,0002,289,664
7Mar 17, 2026 14:2541,936367,699,905337,877,0005,997,0002,351,104
8Mar 17, 2026 14:2542,037371,125,388338,707,0005,994,0002,478,080
9Mar 17, 2026 14:2542,165372,944,526341,752,0003,997,0002,396,160