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 listSep 28, 2026 20:23C21C21Score: 5,555Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 5, 2026 20:31Andrew Epstein10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2026 20:245,49655,609,52743,005,0002,064,0002,113,536
2Sep 28, 2026 20:245,53356,670,08243,226,0002,149,0002,113,536
3Sep 28, 2026 20:245,53955,946,27443,359,0002,063,0002,117,632
4Sep 28, 2026 20:245,55456,030,97943,487,0002,056,0002,117,632
5Sep 28, 2026 20:245,55556,844,57243,438,0002,117,0002,113,536
6Sep 28, 2026 20:245,56156,798,28343,476,0002,126,0002,113,536
7Sep 28, 2026 20:245,56256,179,32443,486,0002,123,0002,117,632
8Sep 28, 2026 20:245,58156,268,35343,544,0002,223,0002,113,536
9Sep 28, 2026 20:245,58856,342,36843,691,0002,131,0002,113,536