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 23, 2026 13:02Dominique GarmierDominique GarmierScore: 22,673Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 13:0222,488207,292,080167,362,00017,036,0002,310,144
2Mar 23, 2026 13:0222,673217,418,923168,929,00016,992,0002,338,816
3Mar 23, 2026 13:0222,810213,479,735170,038,00017,003,0002,453,504