Daily Edition · Page 2

THE DAILY INDEX

Technology, AI, software, security, crypto and business

PROGRAMMING, DESIGN & DATA SCIENCE

TLDR

HASHED SORTING IS TYPICALLY FASTER THAN HASH TABLES

The two standard approaches for counting the unique values in a large array of mostly-unique uint64s are to insert into a hash table and return the number of entries, or to sort the array, then count positions that differ from their predecessor. Sorting is typically faster than hash tables in a well-tuned implementation. This problem and its variants are the inner loop of some of the world's biggest CPU workloads. This article takes a look at why sorting wins, when one should choose hash tables versus a sort, and why it matters.

GOOGLE CHROME AT 17 - A HISTORY OF OUR BROWSER

Google launched Chrome in the fall of 2008. The project has grown from a secret skunkworks into a browser used by billions. Chrome turns 17 this week. This post walks through Chrome's origins and evolution across speed, security, stability, and simplicity, and highlights key milestones. The journey has been one driven by relentless performance improvements, cutting-edge security efforts, and an uncompromising focus on user experience.

TLDR IndexPage 2