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 17, 2026 13:48limanjun99limanjun99Score: 90,917Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 13:4868,220585,459,336428,541,000130,860,0002,310,144
2Mar 17, 2026 13:4885,750732,830,241579,300,000123,850,0002,363,392
3Mar 17, 2026 13:4886,119736,011,987574,328,000131,845,0002,334,720
4Mar 17, 2026 13:4887,978743,654,937599,515,000121,901,0002,306,048
5Mar 17, 2026 13:4890,917770,714,024606,611,000138,911,0002,306,048
6Mar 17, 2026 13:4892,344793,155,322617,366,000139,856,0002,355,200
7Mar 17, 2026 13:4894,567801,251,559652,538,000122,913,0002,314,240
8Mar 17, 2026 13:48108,382919,605,935748,774,000139,957,0002,289,664
9Mar 17, 2026 13:48113,471958,023,051803,533,000126,926,0002,412,544