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 29, 2026 20:00Dominique GarmierDominique GarmierScore: 135,296Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 20:00135,0631,136,356,3881,105,515,0001,999,0002,387,968
2Mar 29, 2026 20:00135,2961,133,497,8011,107,432,0001,998,0002,383,872
3Mar 29, 2026 20:00135,4931,142,452,5761,110,039,0001,000,0002,371,584