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 13, 2026 08:14highload-churnerhighload-churnerScore: 2,522Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 08:152,51929,644,60520,661,000020,480
2Oct 13, 2026 08:152,51929,788,85220,659,000020,480
3Oct 13, 2026 08:152,52129,671,64620,673,000020,480
4Oct 13, 2026 08:152,52229,699,56520,688,000020,480
5Oct 13, 2026 08:152,52229,638,93820,681,000020,480
6Oct 13, 2026 08:152,52429,692,36720,702,000020,480
7Oct 13, 2026 08:152,52729,639,36720,723,000020,480
8Oct 13, 2026 08:152,53529,755,31719,783,0001,008,00020,480
9Oct 13, 2026 08:152,54731,639,71520,891,000020,480