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 listMay 9, 2026 08:02Pavel SkripkinPavel SkripkinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 08:03060,693,64137,023,0008,618,0002,551,808expected "2286562241 ", got " "
2May 9, 2026 08:035,26556,440,44135,737,0007,438,0002,351,104
3May 9, 2026 08:035,33759,808,39536,033,0007,738,0002,338,816
4May 9, 2026 08:035,37758,986,36036,131,0007,966,0002,420,736
5May 9, 2026 08:035,43857,548,46936,457,0008,135,0002,334,720
6May 9, 2026 08:035,46558,737,39436,604,0008,210,0002,453,504
7May 9, 2026 08:035,56858,266,58736,982,0008,683,0002,433,024
8May 9, 2026 08:035,60561,084,32837,770,0008,195,0002,433,024
9May 9, 2026 08:035,72762,741,45737,970,0008,994,0002,375,680