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:46olliecrowolliecrowScore: 3,505Success
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:473,42448,024,41924,070,0004,011,0002,342,912stderr
2Apr 25, 2026 06:473,44444,073,62226,228,0002,017,0002,465,792stderr
3Apr 25, 2026 06:473,46345,080,51526,371,0002,028,0002,523,136stderr
4Apr 25, 2026 06:473,47442,981,27925,437,0003,052,0002,539,520stderr
5Apr 25, 2026 06:473,50550,108,50926,692,0002,053,0002,510,848stderr
6Apr 25, 2026 06:473,53546,744,23024,994,0003,999,0002,498,560stderr
7Apr 25, 2026 06:473,57548,568,95828,311,0001,011,0002,486,272stderr
8Apr 25, 2026 06:473,58248,229,79726,341,0003,039,0002,351,104stderr
9Apr 25, 2026 06:473,65549,501,89926,977,0002,997,0002,351,104stderr