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 13, 2024 01:58zielajzielajError
Source Code

Source code access is restricted. Log in to request access.

Challenge History
DateChallengerCostTypeStatus
Oct 5, 2026 20:57Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 21:000107,688,23395,912,0001,196,00020,480Exit with code 1: 0 4294967295 50000000 100000000 1861152494 2433814800 12503079 0stderr
2Oct 13, 2024 01:5816,810162,056,606124,857,00012,985,0002,400,256
3Oct 13, 2024 01:5816,837163,388,816123,060,00015,007,0002,478,080
4Oct 13, 2024 01:5816,943163,466,843119,945,00018,991,0002,519,040
5Oct 13, 2024 01:5817,410168,198,629124,791,00017,969,0002,404,352
6Oct 13, 2024 01:5817,488167,012,951130,369,00013,036,0002,514,944
7Oct 13, 2024 01:5817,675167,778,879123,946,00020,991,0002,306,048
8Oct 13, 2024 01:5817,919170,416,669129,942,00016,992,0002,338,816
9Oct 13, 2024 01:5818,102173,975,960122,360,00026,076,0002,306,048
10Oct 13, 2024 01:5818,465173,703,291133,363,00018,049,0002,531,328