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 listMar 30, 2026 13:30Dominique GarmierDominique GarmierScore: 18,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 09:0318,390176,542,040148,805,0001,997,0002,314,240
2Mar 30, 2026 13:3018,403177,764,892149,902,000999,0002,322,432
3Mar 30, 2026 11:5318,437180,898,693150,183,0001,001,0002,326,528
4Mar 30, 2026 11:5318,457176,546,975151,347,00002,330,624
5Mar 30, 2026 10:0018,475175,533,979150,491,0001,003,0002,314,240
6Mar 30, 2026 09:0318,480177,939,966150,530,0001,003,0002,326,528
7Mar 30, 2026 10:0018,486180,015,410150,588,000997,0002,289,664
8Mar 30, 2026 11:5318,491176,517,499151,629,00002,289,664
9Mar 30, 2026 10:0018,492176,663,543150,637,000997,0002,424,832
10Mar 30, 2026 13:3018,516181,366,822150,834,000998,0002,289,664
11Mar 30, 2026 13:3018,528180,855,166149,927,0001,999,0002,318,336
12Mar 30, 2026 09:0318,543177,401,382150,052,0002,000,0002,322,432