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 26, 2026 09:44Arseniy KorobenkoArseniy KorobenkoScore: 13,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 09:4413,450133,161,272109,292,0001,002,0002,338,816
2Mar 26, 2026 09:4413,504139,285,896106,744,0003,990,0002,318,336
3Mar 26, 2026 09:4413,507135,452,145107,763,0002,993,0002,342,912
4Mar 26, 2026 09:4413,566140,353,582109,241,0002,004,0002,449,408
5Mar 26, 2026 09:4413,581137,175,430109,359,0002,006,0002,478,080
6Mar 26, 2026 09:4413,594141,526,998108,458,0003,012,0002,338,816
7Mar 26, 2026 09:4413,594143,067,354110,470,0001,004,0002,490,368
8Mar 26, 2026 09:4413,601136,672,336109,522,0002,009,0002,330,624
9Mar 26, 2026 09:4413,625137,619,930109,733,0001,995,0002,330,624