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 21, 2026 22:25Dominique GarmierDominique GarmierScore: 13,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 22:2513,409133,381,499107,955,0001,999,0002,342,912
2Mar 21, 2026 22:2513,662148,624,155110,031,0002,000,0002,449,408
3Mar 21, 2026 22:2513,725134,901,526108,530,0004,019,0002,482,176