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 28, 2026 19:01Dominique GarmierDominique GarmierScore: 10,015Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 19:019,991106,767,41479,926,0001,998,0002,465,792
2Mar 28, 2026 19:0110,015107,997,84779,118,0003,004,0002,412,544
3Mar 28, 2026 19:0110,096108,269,61480,795,0001,994,0002,351,104