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 24, 2026 05:27Dominique GarmierDominique GarmierScore: 9,866Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 05:279,865112,718,17579,894,000998,0002,408,448
2Mar 24, 2026 05:279,866106,385,93979,907,000998,0002,519,040
3Mar 24, 2026 05:279,886107,795,12279,066,0002,001,0002,265,088