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 22, 2026 18:52Dominique GarmierDominique GarmierScore: 17,345Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 18:5217,335163,318,955140,148,0002,002,0002,351,104
2Mar 22, 2026 18:5217,345175,210,998141,225,0001,001,0002,351,104
3Mar 22, 2026 18:5217,400173,952,142141,685,000997,0002,289,664