4 kyu

Count ones in a segment

650 of 3,288d0n14

Description:

Given two numbers: 'left' and 'right' (1 <= 'left' <= 'right' <= 200000000000000) return sum of all '1' occurencies in binary representations of numbers between 'left' and 'right' (including both)

Example:
countOnes 4 7 should return 8, because:
4(dec) = 100(bin), which adds 1 to the result.
5(dec) = 101(bin), which adds 2 to the result.
6(dec) = 110(bin), which adds 2 to the result.
7(dec) = 111(bin), which adds 3 to the result.
So finally result equals 8.

WARNING: Segment may contain billion elements, to pass this kata, your solution cannot iterate through all numbers in the segment!

Binary
Performance
Algorithms

More By Author:

Check out these other kata created by d0n14

Stats:

CreatedJul 17, 2017
PublishedJul 17, 2017
Warriors Trained17732
Total Skips5627
Total Code Submissions23402
Total Times Completed3288
C++ Completions650
Haskell Completions118
JavaScript Completions795
Python Completions1016
C Completions342
NASM Completions22
Java Completions225
Forth Completions12
C# Completions154
COBOL Completions9
Go Completions40
Rust Completions71
Kotlin Completions47
Total Stars748
% of votes with a positive feedback rating94% of 515
Total "Very Satisfied" Votes460
Total "Somewhat Satisfied" Votes45
Total "Not Satisfied" Votes10
Total Rank Assessments8
Average Assessed Rank
4 kyu
Highest Assessed Rank
4 kyu
Lowest Assessed Rank
6 kyu
Ad
Contributors
  • d0n14 Avatar
  • myjinxin2015 Avatar
  • docgunthrop Avatar
  • NerdNeils Avatar
  • Blind4Basics Avatar
  • AlexPuts Avatar
  • nomennescio Avatar
  • har-s Avatar
  • Voile Avatar
  • KataSideKick Avatar
  • monadius Avatar
  • hobovsky Avatar
  • user8436785 Avatar
  • akar-0 Avatar
  • sid114 Avatar
Ad