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 17:07Dominique GarmierDominique GarmierScore: 121,997Success
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 17:07121,5241,021,286,136995,500,000999,0002,510,848
2Mar 27, 2026 17:07121,9971,031,948,414997,374,0002,998,0002,277,376
3Mar 27, 2026 17:07122,8951,032,845,4401,006,736,000999,0002,392,064