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 listJan 8, 2026 20:08Павел РатмановПавел РатмановScore: 39,955Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 20:0839,7411,335,061,1001,299,470,00011,995,0002,326,528
2Jan 8, 2026 20:0839,9551,338,191,3021,305,526,00012,995,0002,326,528
3Jan 8, 2026 20:0841,5271,393,790,1471,359,385,00010,995,0002,273,280