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 11, 2025 14:31Rajarshi BasuRajarshi BasuScore: 34,220Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 14:3133,9031,144,727,1811,109,824,0008,990,0002,519,040
2Dec 11, 2025 14:3134,0621,161,521,0951,117,041,0007,000,0002,351,104
3Dec 11, 2025 14:3134,0631,148,004,9271,112,100,00011,990,0002,457,600
4Dec 11, 2025 14:3134,0811,149,687,3411,107,692,00016,979,0002,400,256
5Dec 11, 2025 14:3134,2201,156,267,5901,119,279,0009,993,0002,453,504
6Dec 11, 2025 14:3134,3631,160,115,5541,126,977,0006,993,0002,424,832
7Dec 11, 2025 14:3134,4921,165,780,1431,125,256,00012,991,0002,494,464
8Dec 11, 2025 14:3134,5141,164,452,3471,131,982,0006,993,0002,437,120
9Dec 11, 2025 14:3135,7791,210,580,7591,171,712,0008,990,0002,510,848