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 listAug 14, 2026 21:03Tomislav TunkovicTomislav TunkovicScore: 2,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 21:112,81332,751,47621,938,0001,135,0002,113,536
2Aug 14, 2026 21:112,81432,136,83621,958,0001,121,0002,113,536
3Aug 14, 2026 21:112,81731,321,07521,975,0001,130,0002,113,536
4Aug 14, 2026 21:112,82131,557,69322,010,0001,126,0002,113,536
5Aug 14, 2026 21:112,82231,753,94822,098,0001,046,0002,113,536
6Aug 14, 2026 21:112,82431,675,05422,041,0001,121,0002,113,536
7Aug 14, 2026 21:112,82832,271,44822,051,0001,143,0002,113,536
8Aug 14, 2026 21:112,82831,676,34622,069,0001,126,0002,113,536
9Aug 14, 2026 21:112,84731,778,54522,223,0001,125,0002,113,536