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 listFeb 13, 2026 11:00FuroremFuroremScore: 261,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 11:00259,0028,580,490,0738,430,138,000116,918,0002,461,696
2Feb 13, 2026 11:00261,0498,650,353,3388,521,665,00092,941,0002,510,848
3Feb 13, 2026 11:00271,1938,983,181,1108,858,423,00090,942,0002,510,848