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 9, 2026 03:36Josu San MartinJosu San MartinScore: 55,756Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 03:3655,5531,862,149,6081,653,510,000179,729,0002,293,760
2Jan 9, 2026 03:3655,7561,868,015,5031,655,159,000184,794,0002,342,912
3Jan 9, 2026 03:3655,7881,872,726,6231,640,221,000200,782,0002,351,104