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 6, 2026 10:50Rajarshi BasuRajarshi BasuScore: 73,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 6, 2026 10:505,01971,913,66435,131,0006,022,0002,449,408
2Jan 6, 2026 10:5073,292626,517,864472,998,000127,999,0002,359,296
3Jan 6, 2026 10:5075,807646,482,729501,689,000119,925,0002,469,888