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 27, 2026 16:45Dominique GarmierDominique GarmierScore: 95,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 14:4294,965808,462,368777,718,000999,0002,433,024
2Mar 27, 2026 16:4595,065806,243,102778,532,000999,0002,338,816
3Mar 27, 2026 14:4295,088809,550,629777,722,0001,999,0002,355,200
4Mar 27, 2026 14:4295,100801,372,656777,821,0001,999,0002,392,064
5Mar 27, 2026 16:4595,335807,040,892780,745,000999,0002,322,432
6Mar 27, 2026 16:4595,504812,357,322781,135,0002,000,0002,367,488