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 26, 2026 21:47Dominique GarmierDominique GarmierScore: 9,408Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 21:479,28598,330,36572,128,0004,007,0002,449,408
2Mar 26, 2026 21:479,40898,600,43473,139,0004,007,0002,379,776
3Mar 26, 2026 21:479,458107,140,12975,538,0002,014,0002,404,352