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 02:43highload-churnerhighload-churnerScore: 2,496Success
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 02:442,49229,378,87220,441,000020,480
2Oct 15, 2026 02:442,49330,061,33720,448,000020,480
3Oct 15, 2026 02:442,49429,363,00420,452,000020,480
4Oct 15, 2026 02:442,49629,612,24420,470,000020,480
5Oct 15, 2026 02:442,49629,388,37020,470,000020,480
6Oct 15, 2026 02:442,50229,535,42720,524,000020,480
7Oct 15, 2026 02:442,50430,120,78120,535,000020,480
8Oct 15, 2026 02:443,45440,877,13825,115,0003,213,00020,480
9Oct 15, 2026 02:446,00258,204,85546,172,0003,045,00020,480