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 04:16olliecrowolliecrowScore: 32,645Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 05:5331,833285,444,609259,033,0002,000,0002,383,872
2Mar 21, 2026 04:1632,436289,807,704262,977,0002,999,0002,433,024
3Mar 20, 2026 05:5332,457291,699,182263,145,0003,001,0002,428,928
4Mar 21, 2026 04:1632,645294,422,620265,690,0001,997,0002,428,928
5Mar 21, 2026 04:1633,066297,749,654269,137,0002,001,0002,330,624
6Mar 20, 2026 05:5334,092306,704,722278,558,000998,0002,326,528