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 30, 2026 20:48Charles CabergsCharles CabergsScore: 4,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 20:484,68257,590,14735,362,0003,031,0002,379,776
2Apr 30, 2026 20:484,69255,304,38837,437,0001,039,0002,367,488
3Apr 30, 2026 20:484,70457,227,91436,544,0002,030,0002,351,104
4Apr 30, 2026 20:484,70755,439,88535,556,0003,047,0002,297,856
5Apr 30, 2026 20:484,73659,705,79836,848,0001,991,0002,338,816
6Apr 30, 2026 20:484,73755,818,54437,853,000996,0002,326,528
7Apr 30, 2026 20:489,58798,910,34977,614,0001,007,0002,420,736
8Apr 30, 2026 20:489,64394,182,55375,024,0004,055,0002,412,544
9Apr 30, 2026 20:489,665101,669,75678,256,0001,003,0002,383,872