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 08:48Karthik ReddyKarthik ReddyScore: 2,542Success
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 09:482,52729,660,85120,726,000020,480
2Oct 9, 2026 09:482,53129,583,85420,760,000020,480
3Oct 9, 2026 09:482,53829,644,50120,812,000020,480
4Oct 9, 2026 09:482,53829,798,73720,815,000020,480
5Oct 9, 2026 09:482,54229,775,54820,850,000020,480
6Oct 9, 2026 09:482,54229,760,41320,852,000020,480
7Oct 9, 2026 09:482,56438,861,07121,026,000020,480
8Oct 9, 2026 09:482,56638,727,30021,044,000020,480
9Oct 9, 2026 09:482,56739,401,05121,050,000020,480