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 07:26Dominique GarmierDominique GarmierScore: 10,366Success
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 07:2610,346115,219,88583,840,000998,0002,383,872
2Mar 24, 2026 07:2610,366112,005,38381,004,0004,000,0002,371,584
3Mar 24, 2026 07:2610,367115,601,63684,011,0001,000,0002,310,144