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 listSep 2, 2026 07:42C#_userC#_userScore: 150,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 07:4698,713819,333,139667,296,000142,151,0002,121,728
2Sep 2, 2026 07:46120,264995,997,524843,362,000142,810,0002,150,400
3Sep 2, 2026 07:46125,7211,040,714,458889,486,000141,434,0002,150,400
4Sep 2, 2026 07:46127,2141,055,960,854899,792,000143,365,0002,150,400
5Sep 2, 2026 07:46150,1011,240,591,8191,090,207,000140,622,0002,150,400
6Sep 2, 2026 07:46171,0391,412,337,7941,261,312,000141,209,0002,232,320
7Sep 2, 2026 07:46187,5751,547,860,9901,396,038,000142,085,0002,150,400
8Sep 2, 2026 07:46190,8591,574,832,5281,424,167,000140,882,0002,232,320
9Sep 2, 2026 07:46204,0571,683,111,4921,530,402,000142,868,0002,150,400