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 10:12C#_userC#_userError
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 10:130886,118,865720,917,000154,211,0002,150,400expected "2103904122 ", got "42138188 "
2Sep 2, 2026 10:1301,410,481,4041,245,867,000154,798,0002,150,400expected "2205087491 ", got "-54373568 "
3Sep 2, 2026 10:1301,446,498,3131,283,835,000152,816,0002,232,320expected "2269746754 ", got "-123536354 "