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:31Dominique GarmierDominique GarmierScore: 18,544Success
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:3118,524642,181,686606,275,0005,002,0002,473,984
2Mar 19, 2026 15:3118,544639,126,937602,944,0008,999,0002,404,352
3Mar 19, 2026 15:3118,552639,689,830605,228,0006,991,0002,519,040