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:04Rajarshi BasuRajarshi BasuScore: 101,879Success
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:0486,865739,095,214601,404,000110,890,0002,420,736
2Jan 2, 2026 08:04101,879863,281,072711,496,000123,912,0002,387,968
3Jan 2, 2026 08:04106,834903,377,525766,163,000109,879,0002,310,144