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 13, 2026 15:57Dominique GarmierDominique GarmierScore: 40,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 15:5740,437359,504,149329,590,0001,997,0002,269,184
2Mar 13, 2026 15:5740,777354,703,089333,374,0001,001,0002,260,992
3Mar 13, 2026 15:5740,815362,662,033331,690,0002,997,0002,293,760