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 listDec 31, 2025 08:22Rajarshi BasuRajarshi BasuScore: 12,575Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 08:2212,543126,696,562100,856,0001,997,0002,523,136
2Dec 31, 2025 08:2212,575126,233,478100,109,0003,003,0002,326,528
3Dec 31, 2025 08:2212,624132,181,503101,507,0002,010,0002,326,528