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 21:19Dominique GarmierDominique GarmierScore: 13,285Success
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 21:1912,999137,359,95695,531,00011,061,0002,367,488
2Mar 27, 2026 21:1913,285134,384,07497,940,00010,993,0002,523,136
3Mar 27, 2026 21:1913,827139,094,388106,358,0007,023,0002,461,696