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 24, 2025 08:51NoSIMD_C#NoSIMD_C#Score: 88,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 24, 2025 08:5187,1132,900,138,5462,824,767,00049,978,0002,453,504
2Jan 24, 2025 08:5188,9572,962,124,2842,901,594,00033,983,0002,531,328
3Jan 24, 2025 08:5189,6592,993,581,5012,920,777,00037,971,0002,441,216