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 8, 2026 06:58Rajarshi BasuRajarshi BasuScore: 74,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 06:585,21180,853,43137,643,0005,086,0002,420,736
2Jan 8, 2026 06:5874,216636,337,680481,662,000126,910,0002,400,256
3Jan 8, 2026 06:5877,616663,588,585516,557,000119,897,0002,490,368