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:39highload-churnerhighload-churnerScore: 2,503Success
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:402,49229,686,76920,441,000020,480
2Oct 15, 2026 02:402,49629,489,06220,468,000020,480
3Oct 15, 2026 02:402,49629,433,21320,474,000020,480
4Oct 15, 2026 02:402,49629,477,63820,474,000020,480
5Oct 15, 2026 02:402,50329,592,19920,526,000020,480
6Oct 15, 2026 02:403,60038,527,96526,142,0003,379,00020,480
7Oct 15, 2026 02:404,12742,934,49230,486,0003,359,00020,480
8Oct 15, 2026 02:405,76856,231,97844,295,0003,010,00020,480
9Oct 15, 2026 02:405,85657,061,45044,766,0003,255,00020,480