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 listFeb 7, 2026 03:02Josu San MartinJosu San MartinScore: 11,254Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 03:0211,215117,373,81590,967,000999,0002,469,888
2Feb 7, 2026 03:0211,254120,045,17192,286,00002,457,600
3Feb 7, 2026 03:0211,255122,530,36890,284,0002,006,0002,461,696