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 9, 2026 11:38Karthik ReddyKarthik ReddyScore: 2,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 12:062,53129,354,83620,758,000020,480
2Oct 9, 2026 12:062,53229,435,38120,770,000020,480
3Oct 9, 2026 12:062,53429,495,38620,783,000020,480
4Oct 9, 2026 12:062,53629,307,06320,796,000020,480
5Oct 9, 2026 12:062,53629,451,93020,800,000020,480
6Oct 9, 2026 12:062,53829,527,83320,816,000020,480
7Oct 9, 2026 12:062,54029,494,32520,835,000020,480
8Oct 9, 2026 12:062,54029,530,51120,828,000020,480
9Oct 9, 2026 12:062,54229,350,02520,851,000020,480