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 listJul 5, 2023 20:50Radek SzymanskiRadek SzymanskiScore: 244,412Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2023 20:50243,3338,088,194,7208,029,998,59002,240,512
2Jul 5, 2023 20:50244,4128,128,240,7348,065,592,59402,297,856
3Jul 5, 2023 20:50245,2128,156,177,6848,091,986,93102,207,744