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 4, 2026 15:53olliecrowolliecrowScore: 12,160Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 15:5312,131121,921,12498,469,0001,004,0002,465,792
2Mar 4, 2026 15:5312,160128,673,36496,724,0002,991,0002,449,408
3Mar 4, 2026 15:5312,161129,005,85397,728,0001,994,0002,461,696