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 listMar 19, 2026 15:34Dominique GarmierDominique GarmierScore: 38,992Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 15:3438,9441,316,036,5041,235,191,00049,967,0002,342,912
2Mar 19, 2026 15:3438,9921,311,794,0981,230,755,00055,988,0002,334,720
3Mar 19, 2026 15:3439,2891,319,494,3071,245,542,00050,981,0002,375,680