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 04:55highload-churnerhighload-churnerScore: 2,493Success
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 04:562,48530,781,09520,379,000020,480
2Oct 15, 2026 04:562,48729,430,90920,396,000020,480
3Oct 15, 2026 04:562,48929,341,83220,417,000020,480
4Oct 15, 2026 04:562,49229,482,76320,441,000020,480
5Oct 15, 2026 04:562,49329,417,88320,443,000020,480
6Oct 15, 2026 04:562,49629,500,13320,474,000020,480
7Oct 15, 2026 04:563,69039,189,15926,893,0003,372,00020,480
8Oct 15, 2026 04:565,79656,443,65844,352,0003,177,00020,480
9Oct 15, 2026 04:565,80156,633,99144,401,0003,171,00020,480