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 30, 2026 16:34Dominique GarmierDominique GarmierScore: 17,695Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 14:4310,827114,607,86984,788,0003,990,0002,453,504
2Mar 31, 2026 00:2317,623170,200,503143,508,0001,003,0002,490,368
3Mar 31, 2026 00:2317,646168,913,070141,707,0002,993,0002,416,640
4Mar 29, 2026 14:4317,684176,380,013143,010,0002,000,0002,461,696
5Mar 29, 2026 14:4317,695168,143,679141,097,0004,002,0002,387,968
6Mar 30, 2026 16:3417,714167,550,316143,250,0002,003,0002,347,008
7Mar 31, 2026 00:2317,741177,824,269144,476,0001,003,0002,351,104
8Mar 30, 2026 16:3417,840167,596,673144,287,0002,003,0002,297,856
9Mar 30, 2026 16:3417,897174,519,017143,764,0002,995,0002,293,760