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 22, 2026 11:45Dominique GarmierDominique GarmierScore: 12,412Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 18:2412,387127,997,199100,570,0001,005,0002,420,736
2Mar 22, 2026 11:4512,388131,192,493100,579,0001,005,0002,416,640
3Mar 25, 2026 18:2412,409134,285,96099,757,0001,995,0002,437,120
4Mar 22, 2026 11:4512,412126,346,57199,783,0001,995,0002,392,064
5Mar 22, 2026 11:4512,424130,257,82598,882,0002,996,0002,338,816
6Mar 25, 2026 18:2412,447128,464,294101,062,0001,000,0002,420,736