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:49highload-churnerhighload-churnerScore: 2,777Success
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:502,75031,550,46821,479,0001,073,0002,113,536
2Oct 13, 2026 00:502,76031,552,36521,591,0001,045,0002,113,536
3Oct 13, 2026 00:502,76831,697,21221,612,0001,090,0002,113,536
4Oct 13, 2026 00:502,77232,411,91121,687,0001,048,0002,113,536
5Oct 13, 2026 00:502,77731,645,24621,728,0001,044,0002,113,536
6Oct 13, 2026 00:502,78231,737,54521,764,0001,051,0002,113,536
7Oct 13, 2026 00:502,79031,830,56921,819,0001,059,0002,113,536
8Oct 13, 2026 00:502,93348,029,23922,934,0001,120,0002,113,536
9Oct 13, 2026 00:5028,872246,002,010235,630,0001,123,0002,113,536