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 00:37highload-churnerhighload-churnerScore: 2,497Success
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 00:382,48929,445,25920,415,000020,480
2Oct 15, 2026 00:382,49329,487,06320,445,000020,480
3Oct 15, 2026 00:382,49429,530,90520,456,000020,480
4Oct 15, 2026 00:382,49529,474,61820,466,000020,480
5Oct 15, 2026 00:382,49729,515,82220,483,000020,480
6Oct 15, 2026 00:382,49829,542,93620,487,000020,480
7Oct 15, 2026 00:382,49929,562,68420,495,000020,480
8Oct 15, 2026 00:382,49929,442,03720,499,000020,480
9Oct 15, 2026 00:384,18643,310,77030,840,0003,486,00020,480