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 listApr 25, 2026 06:26limanjun99limanjun99Score: 5,314Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 06:275,20258,895,26540,629,0002,031,0002,560,000
2Apr 25, 2026 06:275,23959,263,66439,967,0002,997,0002,510,848
3Apr 25, 2026 06:275,27358,296,49240,228,0003,017,0002,383,872
4Apr 25, 2026 06:275,28559,043,43840,314,0003,023,0002,543,616
5Apr 25, 2026 06:275,31459,428,87039,620,0003,962,0002,551,808
6Apr 25, 2026 06:275,31458,421,46041,555,0002,027,0002,523,136
7Apr 25, 2026 06:275,32760,000,56040,637,0003,047,0002,301,952
8Apr 25, 2026 06:275,34161,243,88840,816,0002,986,0002,322,432
9Apr 25, 2026 06:275,39761,517,04940,239,0004,023,0002,519,040