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 18:50Dominique GarmierDominique GarmierScore: 10,099Success
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 18:5010,037106,357,13781,298,0001,003,0002,420,736
2Mar 24, 2026 18:5010,099109,181,15081,818,000997,0002,326,528
3Mar 24, 2026 18:5010,108109,170,22380,891,0001,997,0002,523,136