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 23, 2026 14:44Dominique GarmierDominique GarmierScore: 14,939Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 14:4414,879147,022,051120,006,0002,000,0002,301,952
2Mar 23, 2026 14:4414,939148,703,881121,495,0001,004,0002,351,104
3Mar 23, 2026 14:4414,965149,185,801119,721,0002,993,0002,527,232