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 02:25Dominique GarmierDominique GarmierScore: 22,032Success
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 02:2521,921206,570,638175,760,0003,994,0002,383,872
2Mar 24, 2026 02:2522,032208,094,358179,667,000998,0002,318,336
3Mar 24, 2026 02:2522,300208,825,171178,867,0003,997,0002,535,424