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 listDec 28, 2025 14:27zypehzypehScore: 48,375Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2025 14:2747,3431,590,339,0641,527,340,00034,984,0002,498,560
2Dec 28, 2025 14:2748,3751,617,893,8211,558,381,00037,984,0002,494,464
3Dec 28, 2025 14:2748,6161,634,312,2771,571,330,00032,985,0002,314,240