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 listJan 18, 2026 06:10Josu San MartinJosu San MartinScore: 8,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 06:108,16393,253,51865,939,000999,0002,510,848
2Jan 18, 2026 06:108,16894,113,10464,977,0001,999,0002,514,944
3Jan 18, 2026 06:108,17396,779,92265,017,0002,000,0002,461,696
4Jan 18, 2026 06:108,175100,897,55464,034,0003,001,0002,441,216
5Jan 18, 2026 06:108,17690,181,04165,039,0002,001,0002,514,944
6Jan 18, 2026 06:108,19694,164,74666,202,0001,003,0002,461,696
7Jan 18, 2026 06:108,19790,106,41565,208,0002,006,0002,494,464
8Jan 18, 2026 06:108,19892,967,13165,216,0002,006,0002,494,464
9Jan 18, 2026 06:108,19888,197,14465,217,0002,006,0002,514,944