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 listMar 25, 2026 06:48Dominique GarmierDominique GarmierScore: 14,200Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 06:4814,154144,307,825113,065,0003,001,0002,494,464
2Mar 25, 2026 06:4814,200144,361,158114,431,0002,007,0002,535,424
3Mar 25, 2026 06:4814,252146,555,758112,869,0003,995,0002,514,944