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 27, 2026 02:45Dominique GarmierDominique GarmierScore: 122,513Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 02:45122,4341,027,254,1311,002,962,000999,0002,498,560
2Mar 27, 2026 13:01122,4531,035,519,7651,001,116,0003,000,0002,383,872
3Mar 27, 2026 08:21122,4641,034,527,1611,001,209,0002,997,0002,383,872
4Mar 27, 2026 13:01122,4901,029,337,7591,003,415,000999,0002,338,816
5Mar 27, 2026 08:21122,5131,029,441,3611,001,611,0002,998,0002,367,488
6Mar 27, 2026 13:01122,5181,030,667,1241,001,648,0002,998,0002,371,584
7Mar 27, 2026 08:21122,5771,037,086,4351,002,128,0003,000,0002,510,848
8Mar 27, 2026 02:45122,6331,031,670,7921,004,590,000999,0002,494,464
9Mar 27, 2026 02:45122,6471,032,087,9971,001,706,0003,998,0002,498,560