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 04:23Dominique GarmierDominique GarmierScore: 191,566Success
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 04:23190,4401,586,148,7761,560,611,000999,0002,392,064
2Mar 24, 2026 04:23191,5661,599,623,5411,568,841,0001,998,0002,359,296
3Mar 24, 2026 04:23191,7661,601,023,4721,571,485,000999,0002,383,872