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 00:28highload-churnerhighload-churnerScore: 2,728Success
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 00:292,71731,212,55921,207,0001,076,0002,113,536
2Oct 13, 2026 00:292,71931,232,22621,257,0001,043,0002,113,536
3Oct 13, 2026 00:292,72331,257,39921,331,0001,005,0002,113,536
4Oct 13, 2026 00:292,72531,327,65921,344,0001,007,0002,113,536
5Oct 13, 2026 00:292,72832,796,56921,357,0001,013,0002,113,536
6Oct 13, 2026 00:292,73231,345,40621,388,0001,020,0002,113,536
7Oct 13, 2026 00:292,73631,481,56221,335,0001,102,0002,113,536
8Oct 13, 2026 00:292,74431,441,85921,495,0001,007,0002,113,536
9Oct 13, 2026 00:292,75131,448,79421,432,0001,134,0002,113,536