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 12, 2026 22:09Josu San MartinJosu San MartinScore: 11,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 22:053,30256,748,60325,074,0002,005,0002,494,464
2Mar 12, 2026 22:093,32658,281,59026,263,0001,010,0002,445,312
3Mar 12, 2026 22:113,33353,156,06126,322,0001,012,0002,490,368
4Mar 12, 2026 22:053,33854,617,27825,344,0002,027,0002,482,176
5Mar 12, 2026 22:1111,201122,845,53089,849,0001,996,0002,408,448
6Mar 12, 2026 22:0911,215122,668,19288,967,0002,998,0002,392,064
7Mar 12, 2026 22:1111,217121,279,30588,982,0002,999,0002,392,064
8Mar 12, 2026 22:0511,241112,359,68990,177,0002,003,0002,342,912
9Mar 12, 2026 22:0911,258113,187,92691,309,0001,003,0002,330,624