Skip to content
Avatar
🚀
working hard and fast
🚀
working hard and fast

Achievements

Achievements

Highlights

  • Pro
  • 5 discussions answered

Organizations

@RoaringBitmap @FastFilter @simdjson @fastfloat @bits-and-blooms
Block or Report

Block or report lemire

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
lemire/README.md

Pinned

  1. Parsing gigabytes of JSON per second

    C++ 14.5k 747

  2. A better compressed bitset in Java

    Java 2.4k 413

  3. Roaring bitmaps in Go (golang)

    Go 1.3k 148

  4. Go package implementing Bloom filters

    Go 1.3k 176

  5. Go library implementing binary fuse and xor filters

    Go 505 33

  6. Fast and exact implementation of the C++ from_chars functions for float and double types: 4x faster than strtod

    C++ 730 52

3,121 contributions in the last year

Nov Dec Jan Feb Mar Apr May Jun Jul Aug Sep Oct Mon Wed Fri

Contribution activity

October 2021

Created 1 repository

Created a pull request in simdjson/simdjson that received 2 comments

Cleaning up the single-header demo.

This is in response to issue #1728 by @luizperes I will change the demo example so that it invites people to read our documentation after it runs.

+6 −5 2 comments
Reviewed 5 pull requests in 3 repositories
CarlVerret/csFastFloat 3 pull requests
simdjson/simdjson 1 pull request
RoaringBitmap/RoaringBitmap 1 pull request

Created an issue in CarlVerret/csFastFloat that received 7 comments

SIMD approach for parsing of 8 UTF-16 digits should be as efficient as possible

We should make sure that the code we use is at least as efficient as the routine in this StackOverflow answer: public unsafe uint ParseUint(string t…

7 comments
22 contributions in private repositories Oct 4 – Oct 23

Seeing something unexpected? Take a look at the GitHub profile guide.