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 listSep 24, 2026 08:46Kevin HeaveyKevin HeaveyScore: 2,521Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 08:532,51430,010,90420,616,000020,480
2Sep 24, 2026 08:532,51529,214,50420,629,000020,480
3Sep 24, 2026 08:532,51829,274,78620,655,000020,480
4Sep 24, 2026 08:532,52130,151,85620,675,000020,480
5Sep 24, 2026 08:532,52129,502,46520,679,000020,480
6Sep 24, 2026 08:537,40769,349,27858,720,0002,022,00020,480
7Sep 24, 2026 08:537,43970,385,50458,978,0002,029,00020,480
8Sep 24, 2026 08:537,53070,377,97359,603,0002,148,00020,480
9Sep 24, 2026 08:537,65871,432,60760,682,0002,119,00020,480