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 16:50Dominique GarmierDominique GarmierScore: 16,455Success
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 16:5016,454161,978,801133,924,000999,0002,338,816
2Mar 22, 2026 16:5016,455159,822,138133,935,000999,0002,289,664
3Mar 22, 2026 16:5016,491161,853,508134,229,0001,001,0002,351,104