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 14:54Dominique GarmierDominique GarmierScore: 3,527Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2026 09:343,47049,538,54127,440,0001,016,0002,420,736
2Mar 30, 2026 14:543,49951,619,28727,667,0001,024,0002,367,488
3Mar 31, 2026 09:343,51854,842,15326,859,0001,989,0002,367,488
4Mar 30, 2026 01:223,52558,797,84927,909,000996,0002,314,240
5Mar 30, 2026 01:223,52760,033,13126,924,0001,994,0002,514,944
6Mar 31, 2026 09:343,55153,645,59825,100,0004,016,0002,338,816
7Mar 30, 2026 14:543,55258,983,80726,114,0003,013,0002,273,280
8Mar 30, 2026 01:223,76864,167,08229,902,000996,0002,338,816
9Mar 30, 2026 14:5412,822129,100,656103,137,0002,002,0002,408,448