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 19, 2025 08:42Rajarshi BasuRajarshi BasuScore: 8,054Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 08:427,885287,338,800252,209,0008,006,0002,322,432
2Dec 19, 2025 08:427,952296,406,633255,440,0006,984,0002,301,952
3Dec 19, 2025 08:427,970287,997,499258,018,0005,000,0002,469,888
4Dec 19, 2025 08:428,047294,001,902258,549,0006,987,0002,416,640
5Dec 19, 2025 08:428,054298,176,581259,782,0005,994,0002,355,200
6Dec 19, 2025 08:428,137292,748,069262,543,0005,989,0002,326,528
7Dec 19, 2025 08:428,463308,499,671272,310,0006,982,0002,449,408
8Dec 19, 2025 08:428,472308,064,235273,599,0005,991,0002,281,472
9Dec 19, 2025 08:428,624317,074,302275,612,0008,987,0002,473,984