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 12, 2026 15:41highload-churnerhighload-churnerScore: 26,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 15:4225,251215,995,199206,058,0001,002,0002,113,536
2Oct 12, 2026 15:4225,381217,128,763207,120,0001,011,0002,113,536
3Oct 12, 2026 15:4225,476217,949,897207,882,0001,026,0002,113,536
4Oct 12, 2026 15:4225,510218,160,171208,168,0001,014,0002,113,536
5Oct 12, 2026 15:4226,122223,208,822213,195,0001,008,0002,113,536
6Oct 12, 2026 15:4226,326224,869,388214,858,0001,019,0002,113,536
7Oct 12, 2026 15:4226,635227,371,966217,395,0001,018,0002,113,536
8Oct 12, 2026 15:4226,658227,559,812217,571,0001,031,0002,113,536
9Oct 12, 2026 15:4227,069230,931,878220,879,0001,092,0002,113,536