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 listApr 15, 2026 21:48zielajzielajScore: 5,285Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2026 21:482,80442,329,95521,991,000999,0002,281,472
2Apr 15, 2026 21:492,81750,562,64621,088,0002,008,0002,306,048
3Apr 15, 2026 21:472,82544,440,86022,154,0001,007,0002,387,968
4Apr 15, 2026 21:495,27366,246,99342,235,0001,005,0002,535,424
5Apr 15, 2026 21:495,28568,330,35643,336,00002,494,464
6Apr 15, 2026 21:475,28872,677,97243,365,00002,416,640
7Apr 15, 2026 21:475,31967,515,81442,605,0001,014,0002,297,856
8Apr 15, 2026 21:485,34269,969,35342,810,000995,0002,396,160
9Apr 15, 2026 21:485,38465,041,06042,141,0002,006,0002,326,528