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 05:03highload-churnerhighload-churnerScore: 2,495Success
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 05:042,48929,420,66520,413,000020,480
2Oct 15, 2026 05:042,49229,508,21220,437,000020,480
3Oct 15, 2026 05:042,49329,530,80520,448,000020,480
4Oct 15, 2026 05:042,49529,434,56320,466,000020,480
5Oct 15, 2026 05:042,49529,458,10820,460,000020,480
6Oct 15, 2026 05:042,49629,433,88320,470,000020,480
7Oct 15, 2026 05:042,49829,540,04120,488,000020,480
8Oct 15, 2026 05:042,52129,628,17820,679,000020,480
9Oct 15, 2026 05:044,17043,225,85030,814,0003,386,00020,480