ID64: Quick non-distributed ordered 64-bit ID generator

Quick ordered 64-bit ID generator, single thread only, can generate hundreds of millions (~276M) IDs per second.

Consist of 2 segments:

• time/second segment (32 bit, offsetted to 2021-01-01)
• counter segment (32 bit, reset to 0 every second)

warning: this is not for multi-node/distributed use case, since there's no identity segment, so it may duplicate if generated from >1 server. For distributed use case, use lexid instead of this library.

Benchmark

cpu: AMD Ryzen 3 3100 4-Core Processor    
BenchmarkShortuuid-8      118908      8572 ns/op
BenchmarkKsuid-8          760924      1493 ns/op
BenchmarkNanoid-8         759548      1485 ns/op
BenchmarkUuid-8           935152      1304 ns/op
BenchmarkTime-8          1690483       720.0 ns/op
BenchmarkSnowflake-8     4911249       244.7 ns/op
BenchmarkLexIdNano-8     8483720       138.8 ns/op
BenchmarkLexIdNoSep-8   10396551       116.3 ns/op
BenchmarkLexIdNoLex-8   10590300       115.1 ns/op
BenchmarkLexId-8         9991906       114.9 ns/op
BenchmarkXid-8          13754178        86.02 ns/op
BenchmarkId64-8        276799974         4.362 ns/op <--

Usage

import "github.com/kokizzu/id64"

func main() {
   id := id64.ID()
   
   // or object-oriented version (eg. when you need different generator per thread/table)
   gen := id64.Generator{}
   id = gen.ID()
   
   u64 := uint64(id) // get uint64 value
   // 78224544304726017 
   // can also use: gen.UID() to get uint64 value directly
   
   t := id.Time() // get time.Time of that id
   // 2021-07-31 02:11:11 +0700 WIB
   
   i32 := id.Counter() // get counter of that id
   // 1
   
   s := id.String() // string representation (base64-like encoding) 
   // 3KuBw----0
   // can also use: gen.SID() to get string value directly
   
   i := id64.FromStr(s)
   // 78224544304726017
}

Example Generated ID

These IDs generated with delay of 100ms (left column is the string representation, right column is the uint64 value)

string     uint64
3Kv3F----0 78228345350782977
3Kv3F----1 78228345350782978
3Kv3F----2 78228345350782979
3Kv3F----3 78228345350782980
3Kv3J----0 78228349645750273
3Kv3J----1 78228349645750274
3Kv3J----2 78228349645750275
3Kv3J----3 78228349645750276
3Kv3J----4 78228349645750277
3Kv3J----5 78228349645750278
3Kv3J----6 78228349645750279
3Kv3J----7 78228349645750280

Gotchas

• can be duplicate if your processor can increment faster than 4.2 billion times per second
• might overflow at 2156-07-28 02:08:00 UTC
• it might not ordered/sorted/duplicate if you change your system time to earlier time

See also

lexid - if you need distributed ID (have identity segment)