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:06Pavel SkripkinPavel SkripkinScore: 5,506Success
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:075,34057,031,76635,910,0007,886,0002,396,160
2May 9, 2026 08:075,35758,640,55836,135,0007,794,0002,560,000
3May 9, 2026 08:075,39258,738,56136,162,0008,053,0002,355,200
4May 9, 2026 08:075,45159,226,08536,591,0008,114,0002,416,640
5May 9, 2026 08:075,50659,344,31736,782,0008,370,0002,347,008
6May 9, 2026 08:075,52060,078,75637,028,0008,238,0002,310,144
7May 9, 2026 08:075,64959,894,44837,502,0008,824,0002,510,848
8May 9, 2026 08:075,78763,897,04538,224,0009,233,0002,473,984
9May 9, 2026 08:075,90862,275,50938,857,0009,589,0002,326,528