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 28, 2025 14:15zypehzypehScore: 57,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2025 14:1557,2491,922,145,3761,860,231,00028,988,0002,473,984
2Dec 28, 2025 14:1557,7211,929,524,2311,869,814,00034,977,0002,478,080
3Dec 28, 2025 14:1557,7431,935,738,1731,872,521,00032,991,0002,347,008