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 27, 2025 21:47Josu San MartinJosu San MartinScore: 37,133Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 21:4736,9701,250,323,4501,213,018,0006,994,0002,318,336
2Dec 27, 2025 21:4737,1331,254,364,3261,217,388,0007,995,0002,306,048
3Dec 27, 2025 21:4737,3881,261,504,7941,226,797,0006,993,0002,347,008