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 listOct 12, 2025 03:22Marco BarboneMarco BarboneScore: 47,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2025 03:2247,5771,600,060,8781,558,034,00011,992,0002,334,720
2Oct 12, 2025 03:2247,8951,609,723,3111,564,551,00015,985,0002,326,528
3Oct 12, 2025 03:2248,5651,631,592,5221,587,667,00014,968,0002,277,376