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 19, 2026 16:23Victor MerckléVictor MerckléScore: 2,765Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 16:282,72730,617,06821,286,0001,082,0002,117,632stderr
2Aug 19, 2026 16:282,75030,787,62021,534,0001,017,0002,117,632stderr
3Aug 19, 2026 16:282,76231,619,25421,631,0001,020,0002,117,632stderr
4Aug 19, 2026 16:282,76330,965,55421,647,0001,014,0002,117,632stderr
5Aug 19, 2026 16:282,76530,848,20921,645,0001,028,0002,117,632stderr
6Aug 19, 2026 16:285,36553,016,64642,865,0001,136,0002,117,632stderr
7Aug 19, 2026 16:285,43152,664,46943,524,0001,017,0002,117,632stderr
8Aug 19, 2026 16:285,43553,911,95343,441,0001,131,0002,117,632stderr
9Aug 19, 2026 16:287,99474,395,78164,407,0001,147,0002,117,632stderr