6 kyu
Bit Counting
18,031 of 255,455xcthulhu
Description:
Write a function that takes an integer as input, and returns the number of bits that are equal to one in the binary representation of that number. You can guarantee that input is non-negative.
Example: The binary representation of 1234 is 10011010010, so the function should return 5 in this case
Bits
Algorithms
Similar Kata:
Stats:
| Created | Oct 21, 2013 |
| Published | Oct 21, 2013 |
| Warriors Trained | 509417 |
| Total Skips | 61859 |
| Total Code Submissions | 604324 |
| Total Times Completed | 255455 |
| Ruby Completions | 6691 |
| CoffeeScript Completions | 269 |
| JavaScript Completions | 73669 |
| Python Completions | 91318 |
| C# Completions | 18031 |
| Java Completions | 29167 |
| PHP Completions | 6250 |
| C Completions | 6650 |
| Clojure Completions | 335 |
| Rust Completions | 3435 |
| Shell Completions | 440 |
| NASM Completions | 155 |
| Crystal Completions | 54 |
| Go Completions | 3598 |
| C++ Completions | 12861 |
| Scala Completions | 629 |
| Swift Completions | 1495 |
| Groovy Completions | 96 |
| Julia Completions | 165 |
| Haskell Completions | 1186 |
| TypeScript Completions | 5026 |
| Elixir Completions | 267 |
| COBOL Completions | 18 |
| Prolog Completions | 29 |
| Lua Completions | 182 |
| D Completions | 23 |
| Perl Completions | 6 |
| Total Stars | 2549 |
| % of votes with a positive feedback rating | 88% of 24292 |
| Total "Very Satisfied" Votes | 19051 |
| Total "Somewhat Satisfied" Votes | 4788 |
| Total "Not Satisfied" Votes | 453 |
