Unique strings Sergey Svistunov

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listJan 21, 2025 07:34NoSIMD_C#NoSIMD_C#Score: 88,620Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 07:3486,6302,888,788,3472,811,819,00046,980,0002,367,488
2Jan 21, 2025 07:3486,8292,893,989,3372,826,379,00038,977,0002,408,448
3Jan 21, 2025 07:3487,5692,919,067,4282,843,806,00045,980,0002,322,432
4Jan 21, 2025 07:3488,3002,945,062,3212,873,925,00039,971,0002,428,928
5Jan 21, 2025 07:3488,6202,953,044,4392,883,480,00040,992,0002,498,560
6Jan 21, 2025 07:3489,3862,978,261,8362,908,756,00040,982,0002,306,048
7Jan 21, 2025 07:3494,2073,137,510,8353,050,883,00057,959,0002,326,528
8Jan 21, 2025 07:3497,6313,253,552,6603,170,861,00050,965,0002,355,200
9Jan 21, 2025 07:34113,1853,768,336,2283,667,165,00067,947,0002,486,272