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 21, 2026 01:12Dominique GarmierDominique GarmierScore: 13,109Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 01:1213,049133,675,669105,005,0002,000,0002,375,680
2Mar 21, 2026 02:1713,061133,399,181105,096,0002,001,0002,383,872
3Mar 21, 2026 02:1713,065135,198,219104,127,0003,003,0002,400,256
4Mar 21, 2026 01:1213,109134,881,365106,493,0001,004,0002,326,528
5Mar 21, 2026 02:1713,117135,518,474106,555,0001,005,0002,289,664
6Mar 21, 2026 01:1213,136134,707,956106,721,000997,0002,506,752