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 1, 2026 16:54Alexander KrivolapovAlexander KrivolapovScore: 31,460Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 1, 2026 16:5431,4521,067,311,905924,027,000113,880,0002,301,952
2Mar 1, 2026 16:5431,4601,063,767,245932,253,000105,915,0002,314,240
3Mar 1, 2026 16:5431,4861,063,174,758919,143,000119,888,0002,498,560