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 listMay 1, 2026 17:04Pavel SkripkinPavel SkripkinScore: 13,870Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 17:0513,863126,282,222110,686,0002,991,0002,330,624
2May 1, 2026 17:0513,863130,991,751111,670,0002,012,0002,412,544
3May 1, 2026 17:0513,867130,463,394110,723,0002,992,0002,412,544
4May 1, 2026 17:0513,868131,634,515111,712,0002,012,0002,318,336
5May 1, 2026 17:0513,870135,425,481112,741,000997,0002,420,736
6May 1, 2026 17:0513,878128,391,534111,806,0001,996,0002,326,528
7May 1, 2026 17:0513,897136,037,292111,958,0001,999,0002,416,640
8May 1, 2026 17:0513,915132,310,466112,107,0002,001,0002,416,640
9May 1, 2026 17:0513,921129,554,265112,151,0002,002,0002,408,448