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 listOct 3, 2026 01:50Karthik ReddyKarthik ReddyScore: 2,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2026 01:512,48529,393,38820,383,000020,480
2Oct 3, 2026 01:512,48929,412,67620,410,000020,480
3Oct 3, 2026 01:512,49129,410,71220,434,000020,480
4Oct 3, 2026 01:512,49229,623,65320,437,000020,480
5Oct 3, 2026 01:512,49330,859,96420,444,000020,480
6Oct 3, 2026 01:512,49329,412,02220,445,000020,480
7Oct 3, 2026 01:512,49729,505,34120,477,000020,480
8Oct 3, 2026 01:512,49829,528,47820,486,000020,480
9Oct 3, 2026 01:512,49929,531,80520,497,000020,480