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 14:25Arseniy KorobenkoArseniy KorobenkoScore: 10,041Success
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 14:259,991103,379,09177,930,0003,996,0002,490,368
2Mar 26, 2026 14:2510,031107,660,69978,242,0004,012,0002,347,008
3Mar 26, 2026 14:2510,035110,898,75280,284,0002,007,0002,437,120
4Mar 26, 2026 14:2510,040103,690,98381,322,0001,003,0002,338,816
5Mar 26, 2026 14:2510,041107,569,41479,323,0003,012,0002,297,856
6Mar 26, 2026 14:2510,071113,771,42181,575,0001,007,0002,277,376
7Mar 26, 2026 14:2510,087108,441,17079,722,0002,989,0002,314,240
8Mar 26, 2026 14:2510,091108,001,05380,750,0001,993,0002,408,448
9Mar 26, 2026 14:2510,091111,840,02980,750,0001,993,0002,297,856