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 02:15highload-churnerhighload-churnerScore: 2,506Success
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 02:162,49429,514,01320,457,000020,480
2Oct 15, 2026 02:162,49629,499,48020,472,000020,480
3Oct 15, 2026 02:162,49629,464,42820,468,000020,480
4Oct 15, 2026 02:162,49729,535,74920,477,000020,480
5Oct 15, 2026 02:162,50629,570,00920,553,000020,480
6Oct 15, 2026 02:162,51929,692,46520,663,000020,480
7Oct 15, 2026 02:163,61638,600,80026,337,0003,315,00020,480
8Oct 15, 2026 02:164,11342,727,07930,462,0003,271,00020,480
9Oct 15, 2026 02:164,13654,591,43430,881,0003,042,00020,480