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 04:00Josu San MartinJosu San MartinScore: 116,773Success
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 04:00114,7183,812,982,1473,762,724,00022,986,0002,330,624
2Dec 28, 2025 04:00116,7733,880,423,8973,833,525,00019,992,0002,498,560
3Dec 28, 2025 04:00117,7333,917,477,5063,864,211,00020,990,0002,416,640