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:15Kevin HeaveyKevin HeaveyScore: 2,546Success
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:162,53529,418,36819,792,0001,003,00020,480
2Sep 24, 2026 08:162,54029,531,34019,823,0001,008,00020,480
3Sep 24, 2026 08:162,54229,545,87219,805,0001,042,00020,480
4Sep 24, 2026 08:162,54429,590,20719,860,0001,004,00020,480
5Sep 24, 2026 08:162,54629,529,23519,846,0001,034,00020,480
6Sep 24, 2026 08:162,55029,654,91919,910,0001,007,00020,480
7Sep 24, 2026 08:167,79473,992,46061,888,0002,023,00020,480
8Sep 24, 2026 08:167,88374,063,92862,620,0002,021,00020,480
9Sep 24, 2026 08:167,99574,160,24863,540,0002,025,00020,480