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 16:44Dominique GarmierDominique GarmierScore: 14,944Success
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 16:4414,902147,509,165118,193,0004,006,0002,371,584
2Mar 28, 2026 16:4414,944150,282,697120,532,0002,008,0002,326,528
3Mar 28, 2026 16:4414,965149,167,995119,723,0002,993,0002,297,856