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 05:17Josu San MartinJosu San MartinScore: 11,625Success
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 05:1711,614125,753,55193,231,0002,004,0002,621,440
2Jan 18, 2026 05:1711,625124,831,28193,317,0002,006,0002,404,352
3Jan 18, 2026 05:1711,643126,139,46594,467,0001,004,0002,408,448