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 listJul 25, 2025 13:50Hayk KarapetyanHayk KarapetyanScore: 295,380Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2025 13:50290,6699,629,825,7909,473,142,000118,926,0002,330,624
2Jul 25, 2025 13:50295,3809,787,503,1649,626,606,000120,919,0002,396,160
3Jul 25, 2025 13:50295,5159,790,700,9099,635,078,000116,928,0002,273,280