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:52C#_userC#_userScore: 124,695Success
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:56104,641867,853,247716,467,000141,597,0002,150,400
2Sep 2, 2026 09:56113,828946,141,336795,028,000138,366,0002,154,496
3Sep 2, 2026 09:56116,032961,271,739810,134,000141,335,0002,232,320
4Sep 2, 2026 09:56121,9201,009,606,796857,944,000141,808,0002,150,400
5Sep 2, 2026 09:56124,6951,032,412,933880,930,000141,574,0002,150,400
6Sep 2, 2026 09:56131,3861,088,428,425935,906,000141,461,0002,150,400
7Sep 2, 2026 09:56137,7631,139,652,426990,343,000139,317,0002,232,320
8Sep 2, 2026 09:56139,9851,157,715,1751,007,774,000140,106,0002,150,400
9Sep 2, 2026 09:56141,5481,170,670,7111,020,954,000139,747,0002,150,400