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 listMar 24, 2026 03:27Dominique GarmierDominique GarmierScore: 10,302Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 03:2710,288108,724,04583,358,0001,004,0002,371,584
2Mar 24, 2026 03:2710,302105,613,65883,471,0001,005,0002,347,008
3Mar 24, 2026 03:2710,341116,053,54882,800,0001,995,0002,342,912