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 02:00zielajzielajError
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,823,02795,800,0001,166,00020,480Exit with code 1: 0 4294967295 50000000 100000000 1932735283 2362232011 49788633 0stderr
2Oct 13, 2024 02:0015,255149,833,175116,081,0009,006,0002,289,664
3Oct 13, 2024 02:0015,317155,942,601112,539,00013,062,0002,379,776
4Oct 13, 2024 02:0015,531155,783,808115,321,00012,033,0002,514,944
5Oct 13, 2024 02:0015,540156,480,861112,374,00015,050,0002,383,872
6Oct 13, 2024 02:0015,580153,553,894111,789,00015,969,0002,473,984
7Oct 13, 2024 02:0015,627155,936,146112,126,00016,018,0002,273,280
8Oct 13, 2024 02:0015,748154,903,717115,120,00014,014,0002,396,160
9Oct 13, 2024 02:0015,763153,332,318116,232,00013,026,0002,424,832
10Oct 13, 2024 02:0015,853161,710,143114,995,00014,999,0002,342,912