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 26, 2026 18:39Kevin HeaveyKevin HeaveyScore: 2,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 18:402,50131,659,92119,507,0001,003,00020,480
2Sep 26, 2026 18:402,50231,057,42320,523,000020,480
3Sep 26, 2026 18:402,50632,124,99420,553,000020,480
4Sep 26, 2026 18:402,50732,092,81120,564,000020,480
5Sep 26, 2026 18:402,50831,969,20120,571,000020,480
6Sep 26, 2026 18:402,51331,100,91019,602,0001,007,00020,480
7Sep 26, 2026 18:405,86358,154,74146,061,0002,022,00020,480
8Sep 26, 2026 18:405,96859,080,91546,912,0002,032,00020,480
9Sep 26, 2026 18:406,05159,794,38647,583,0002,039,00020,480