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 23:45Dominique GarmierDominique GarmierScore: 12,429Success
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 23:4512,344129,661,894100,217,0001,002,0002,498,560
2Mar 24, 2026 23:4512,429128,288,509100,915,000999,0002,412,544
3Mar 24, 2026 23:4512,594129,835,80399,259,0004,010,0002,273,280