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 01:55highload-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 01:562,48829,518,23920,403,000020,480
2Oct 15, 2026 01:562,49229,467,04020,438,000020,480
3Oct 15, 2026 01:562,49229,449,26420,442,000020,480
4Oct 15, 2026 01:562,49329,485,70720,450,000020,480
5Oct 15, 2026 01:562,49529,534,46120,461,000020,480
6Oct 15, 2026 01:562,49932,584,06320,492,000020,480
7Oct 15, 2026 01:562,49929,482,87220,492,000020,480
8Oct 15, 2026 01:562,50829,510,56220,573,000020,480
9Oct 15, 2026 01:564,19243,423,35430,887,0003,492,00020,480