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 16:35highload-churnerhighload-churnerScore: 5,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 16:584,74148,404,90536,844,0002,034,00024,576
2Oct 9, 2026 16:585,03350,252,52239,202,0002,069,00024,576
3Oct 9, 2026 16:585,04150,346,93439,294,0002,050,00024,576
4Oct 9, 2026 16:585,09250,621,04739,749,0002,012,00024,576
5Oct 9, 2026 16:585,11650,894,08539,903,0002,050,00024,576
6Oct 9, 2026 16:585,12451,035,84739,959,0002,065,00024,576
7Oct 9, 2026 16:585,15051,353,68341,207,0001,025,00024,576
8Oct 9, 2026 16:585,18752,560,39440,519,0002,018,00024,576
9Oct 9, 2026 16:585,22551,805,69740,783,0002,064,00024,576