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 listFeb 7, 2026 05:49Josu San MartinJosu San MartinScore: 11,208Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 05:493,39656,682,40324,867,0002,984,0002,375,680
2Feb 7, 2026 05:493,41353,748,05124,986,0002,998,0002,277,376
3Feb 7, 2026 05:493,42154,037,48227,052,0001,001,0002,322,432
4Feb 7, 2026 05:4711,184116,667,16789,717,0001,993,0002,494,464
5Feb 7, 2026 05:4711,200121,832,62689,848,0001,996,0002,293,760
6Feb 7, 2026 05:5011,207120,883,72889,903,0001,997,0002,453,504
7Feb 7, 2026 05:5011,208118,525,37588,910,0002,996,0002,478,080
8Feb 7, 2026 05:4911,213122,659,66689,950,0001,998,0002,424,832
9Feb 7, 2026 05:4911,218112,181,00890,991,000999,0002,490,368
10Feb 7, 2026 05:5011,238113,650,09589,146,0003,004,0002,514,944
11Feb 7, 2026 05:4711,257115,732,08588,295,0004,013,0002,453,504
12Feb 7, 2026 05:4911,258119,368,41592,312,00002,465,792