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 15, 2026 00:46highload-churnerhighload-churnerScore: 2,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 00:472,48929,519,55320,413,000020,480
2Oct 15, 2026 00:472,49029,374,64220,420,000020,480
3Oct 15, 2026 00:472,49330,847,61420,446,000020,480
4Oct 15, 2026 00:472,49529,526,07520,462,000020,480
5Oct 15, 2026 00:472,50829,648,10920,571,000020,480
6Oct 15, 2026 00:472,51529,654,69620,630,000020,480
7Oct 15, 2026 00:473,52637,997,40325,634,0003,282,00020,480
8Oct 15, 2026 00:473,60038,539,34026,070,0003,450,00020,480
9Oct 15, 2026 00:474,87148,937,37936,439,0003,510,00020,480