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 09:14highload-churnerhighload-churnerScore: 2,580Success
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 09:152,57330,063,57920,079,0001,023,00028,672stderr
2Oct 13, 2026 09:152,57630,076,11120,090,0001,036,00028,672stderr
3Oct 13, 2026 09:152,57630,059,68320,098,0001,028,00028,672stderr
4Oct 13, 2026 09:152,57730,054,50320,091,0001,041,00028,672stderr
5Oct 13, 2026 09:152,58030,167,99420,138,0001,018,00028,672stderr
6Oct 13, 2026 09:152,58130,112,32620,138,0001,028,00028,672stderr
7Oct 13, 2026 09:152,58230,187,42420,154,0001,021,00028,672stderr
8Oct 13, 2026 09:152,58530,674,45920,159,0001,046,00028,672stderr
9Oct 13, 2026 09:152,61531,847,71920,414,0001,032,00028,672stderr