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 22, 2025 06:20Rajarshi BasuRajarshi BasuScore: 21,095Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 06:2020,900712,727,843674,718,00014,993,0002,420,736
2Dec 22, 2025 06:2021,095722,579,667680,117,00016,002,0002,506,752
3Dec 22, 2025 06:2021,175726,444,452690,786,0007,997,0002,281,472