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 15:05Dominique GarmierDominique GarmierScore: 11,955Success
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 15:0511,922123,657,16094,766,0002,992,0002,359,296
2Mar 23, 2026 15:0511,955132,570,19696,035,0002,000,0002,400,256
3Mar 23, 2026 15:0512,021123,247,29896,558,0002,011,0002,387,968