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:01highload-churnerhighload-churnerScore: 2,496Success
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:022,49129,474,12820,429,000020,480
2Oct 15, 2026 02:022,49229,455,90920,436,000020,480
3Oct 15, 2026 02:022,49229,430,56320,435,000020,480
4Oct 15, 2026 02:022,49529,533,16220,466,000020,480
5Oct 15, 2026 02:022,49629,453,15820,474,000020,480
6Oct 15, 2026 02:022,49729,454,67720,482,000020,480
7Oct 15, 2026 02:022,49729,448,03220,483,000020,480
8Oct 15, 2026 02:024,11042,712,80930,436,0003,273,00020,480
9Oct 15, 2026 02:024,17243,180,12231,166,0003,045,00020,480