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 listJul 8, 2025 19:18Adam FolwarcznyAdam FolwarcznyScore: 16,183Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2025 19:188,83999,639,23061,406,00011,073,0002,469,888
2Jul 8, 2025 19:1811,448120,240,83884,886,0008,987,0002,359,296
3Jul 8, 2025 19:1814,667141,174,350105,235,00015,033,0002,404,352
4Jul 8, 2025 19:1815,457156,105,181116,771,0009,980,0002,265,088
5Jul 8, 2025 19:1816,183161,201,680119,733,00012,971,0002,400,256
6Jul 8, 2025 19:1818,075177,024,028136,201,00012,017,0002,461,696
7Jul 8, 2025 19:18113,530963,081,899813,083,000117,867,0002,297,856
8Jul 8, 2025 19:18135,2491,133,856,371995,140,000113,901,0002,326,528
9Jul 8, 2025 19:18142,7941,198,974,0281,071,001,00099,906,0002,486,272