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 listOct 3, 2026 01:22Karthik ReddyKarthik ReddyScore: 2,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2026 01:222,48429,383,08320,371,000020,480
2Oct 3, 2026 01:222,58330,245,47120,028,0001,158,00020,480
3Oct 3, 2026 01:222,60231,317,53620,078,0001,262,00020,480
4Oct 3, 2026 01:222,66630,816,49320,201,0001,663,00020,480
5Oct 3, 2026 01:222,68931,034,43320,291,0001,763,00020,480
6Oct 3, 2026 01:222,90132,822,92019,632,0004,160,00020,480
7Oct 3, 2026 01:224,79248,311,02439,295,000020,480
8Oct 3, 2026 01:225,06450,501,26639,450,0002,075,00020,480
9Oct 3, 2026 01:225,14351,178,86538,681,0003,497,00020,480