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 18, 2026 06:50Josu San MartinJosu San MartinScore: 22,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 06:5022,508213,704,771183,566,0001,003,0002,293,760
2Jan 18, 2026 06:5022,793217,134,183183,902,0002,998,0002,293,760
3Jan 18, 2026 06:5022,923213,624,064185,969,0001,999,0002,359,296