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 27, 2026 09:12Kevin HeaveyKevin HeaveyScore: 2,530Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2026 09:132,49929,356,30020,499,000020,480
2Sep 27, 2026 09:132,50129,484,51320,513,000020,480
3Sep 27, 2026 09:132,50329,568,37520,531,000020,480
4Sep 27, 2026 09:132,52329,662,00920,691,000020,480
5Sep 27, 2026 09:132,53029,687,03520,747,000020,480
6Sep 27, 2026 09:135,71155,866,41544,816,0002,021,00020,480
7Sep 27, 2026 09:135,77056,229,49845,293,0002,024,00020,480
8Sep 27, 2026 09:135,95657,877,26646,810,0002,030,00020,480
9Sep 27, 2026 09:135,99858,146,81947,159,0002,026,00020,480