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 listJan 9, 2026 23:08Josu San MartinJosu San MartinScore: 7,871Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 23:077,825288,364,738252,211,0006,005,0002,326,528
2Jan 9, 2026 23:077,867284,558,249253,635,0005,991,0002,326,528
3Jan 9, 2026 23:087,869285,176,774252,676,0006,991,0002,289,664
4Jan 9, 2026 23:087,871290,071,292252,758,0006,993,0002,351,104
5Jan 9, 2026 23:087,880284,192,469252,051,0008,001,0002,351,104
6Jan 9, 2026 23:078,836317,117,532284,601,0006,990,0002,326,528