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 15, 2026 04:00highload-churnerhighload-churnerScore: 2,494Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 04:012,48429,450,46220,376,000020,480
2Oct 15, 2026 04:012,49030,927,44520,422,000020,480
3Oct 15, 2026 04:012,49029,480,68320,424,000020,480
4Oct 15, 2026 04:012,49229,403,21520,437,000020,480
5Oct 15, 2026 04:012,49429,527,29920,451,000020,480
6Oct 15, 2026 04:012,50729,557,39520,565,000020,480
7Oct 15, 2026 04:012,51629,563,27920,636,000020,480
8Oct 15, 2026 04:013,57738,346,97126,075,0003,258,00020,480
9Oct 15, 2026 04:013,66539,073,13326,994,0003,066,00020,480