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:34highload-churnerhighload-churnerScore: 3,327Success
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 01:133,23935,507,91425,495,0001,069,00024,576
2Oct 10, 2026 01:133,30736,078,82026,054,0001,065,00024,576
3Oct 10, 2026 01:133,31536,728,64226,131,0001,059,00024,576
4Oct 10, 2026 01:133,32736,827,44526,255,0001,030,00024,576
5Oct 10, 2026 01:133,32736,258,38626,224,0001,061,00024,576
6Oct 10, 2026 01:133,33436,248,90326,305,0001,034,00024,576
7Oct 10, 2026 01:133,34436,338,06326,368,0001,060,00024,576
8Oct 10, 2026 01:133,34736,330,19126,387,0001,059,00024,576
9Oct 10, 2026 01:133,35936,553,68626,477,0001,069,00024,576