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 21, 2026 15:51Dominique GarmierDominique GarmierScore: 18,383Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 15:5118,351183,297,074150,476,00002,285,568
2Mar 21, 2026 15:5118,383178,532,574148,743,0001,996,0002,285,568
3Mar 21, 2026 15:5118,631182,171,637151,780,000998,0002,326,528