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 10, 2026 20:53olliecrowolliecrowScore: 15,092Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 20:5310,102108,378,29081,839,000998,0002,449,408
2Mar 10, 2026 20:5315,092148,259,489123,755,00002,457,600
3Mar 10, 2026 20:5315,381151,977,438125,126,0001,001,0002,359,296