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 9, 2026 23:05highload-churnerhighload-churnerScore: 3,509Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 00:423,43837,159,25027,167,0001,032,00024,576
2Oct 10, 2026 00:423,46338,814,38527,367,0001,033,00024,576
3Oct 10, 2026 00:423,49237,635,90826,554,0002,084,00024,576
4Oct 10, 2026 00:423,50137,813,63827,683,0001,033,00024,576
5Oct 10, 2026 00:423,50937,735,41327,702,0001,075,00024,576
6Oct 10, 2026 00:423,53138,050,36927,927,0001,033,00024,576
7Oct 10, 2026 00:423,56638,299,43228,207,0001,036,00024,576
8Oct 10, 2026 00:423,57538,148,51628,284,0001,034,00024,576
9Oct 10, 2026 00:423,57638,362,71327,321,0002,003,00024,576