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 listJan 7, 2026 10:21Rajarshi BasuRajarshi BasuScore: 75,169Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 10:214,77866,618,50834,157,0005,023,0002,412,544
2Jan 7, 2026 10:2175,169643,848,000488,515,000127,873,0002,441,216
3Jan 7, 2026 10:2175,503647,059,043503,101,000116,023,0002,498,560