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:07Rajarshi BasuRajarshi BasuScore: 81,313Success
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:075,40168,406,53840,260,0004,026,0002,523,136
2Jan 2, 2026 08:0781,313693,869,414546,809,000119,958,0002,453,504
3Jan 2, 2026 08:0787,120743,433,444587,495,000126,890,0002,433,024