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 23:07Dominique GarmierDominique GarmierScore: 160,783Success
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 23:07160,6431,348,160,9071,315,277,0001,998,0002,314,240
2Mar 26, 2026 23:07160,7831,341,891,9911,315,425,0002,998,0002,473,984
3Mar 26, 2026 23:07161,2451,350,707,6431,319,212,0002,998,0002,281,472