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 09:26C#_userC#_userScore: 156,109Success
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 09:30122,5281,014,972,035863,250,000141,487,0002,150,400
2Sep 2, 2026 09:30122,5681,015,119,577866,891,000138,169,0002,150,400
3Sep 2, 2026 09:30128,3671,062,391,760911,930,000140,687,0002,150,400
4Sep 2, 2026 09:30155,8091,287,456,6651,136,687,000140,948,0002,170,880
5Sep 2, 2026 09:30156,1091,289,960,1031,138,094,000142,001,0002,199,552
6Sep 2, 2026 09:30157,5521,301,792,4021,153,192,000138,736,0002,150,400
7Sep 2, 2026 09:30160,2441,325,081,5141,174,108,000139,898,0002,150,400
8Sep 2, 2026 09:30161,1411,331,183,0351,180,008,000141,350,0002,150,400
9Sep 2, 2026 09:30181,1231,495,033,9891,346,702,000138,509,0002,154,496