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 2, 2026 08:09Rajarshi BasuRajarshi BasuScore: 5,152Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 08:094,70666,086,29235,544,0003,046,0002,445,312
2Jan 2, 2026 08:095,15267,167,29139,231,0003,017,0002,297,856
3Jan 2, 2026 08:09103,648879,594,416723,079,000126,838,0002,281,472