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 listApr 16, 2026 20:13olliecrowolliecrowScore: 100,813Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 20:13100,395851,088,584822,237,0001,000,0002,469,888
2Apr 16, 2026 20:13100,813848,536,877823,665,0002,998,0002,310,144
3Apr 16, 2026 20:13143,8001,206,462,4751,177,161,0001,998,0002,293,760