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 listDec 16, 2024 09:41NoSIMD_C#NoSIMD_C#Score: 134,678Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 16, 2024 09:41134,3514,459,268,5304,410,582,00022,987,0002,310,144
2Dec 16, 2024 09:41134,6784,469,597,1214,424,376,00019,988,0002,465,792
3Dec 16, 2024 09:41135,1854,486,328,7844,437,123,00023,984,0002,482,176