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 24, 2026 04:27Dominique GarmierDominique GarmierScore: 20,155Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 04:5320,127188,432,096163,039,0002,000,0002,322,432
2Mar 24, 2026 04:5320,140185,315,926163,146,0002,001,0002,383,872
3Mar 24, 2026 04:5320,140197,061,128163,148,0002,001,0002,326,528
4Mar 24, 2026 04:2720,155191,731,535164,269,0001,001,0002,322,432
5Mar 24, 2026 04:2720,176187,237,220163,438,0002,005,0002,375,680
6Mar 24, 2026 04:2720,176190,576,840164,442,0001,002,0002,387,968