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 listApr 14, 2026 04:37Yuriy LyfenkoYuriy LyfenkoScore: 3,164Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2026 04:373,10449,196,53723,419,0002,036,0002,359,296
2Apr 14, 2026 04:373,11654,743,27924,528,0001,022,0002,318,336
3Apr 14, 2026 04:373,12649,134,74923,584,0002,050,0002,428,928
4Apr 14, 2026 04:373,15350,111,96823,867,0001,988,0002,486,272
5Apr 14, 2026 04:373,16456,833,29222,953,0002,993,0002,420,736
6Apr 14, 2026 04:373,16648,827,12121,971,0003,994,0002,502,656
7Apr 14, 2026 04:373,16851,793,14723,978,0001,998,0002,289,664
8Apr 14, 2026 04:373,19852,757,48724,204,0002,017,0002,396,160
9Apr 14, 2026 04:373,24059,419,35624,524,0002,043,0002,441,216