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 20, 2025 08:23Rajarshi BasuRajarshi BasuScore: 5,244Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 08:235,185195,066,504165,094,0006,003,0002,519,040
2Dec 20, 2025 08:235,196206,968,670165,497,0005,981,0002,383,872
3Dec 20, 2025 08:235,207198,505,487167,848,0003,996,0002,514,944
4Dec 20, 2025 08:235,217197,588,294167,157,0005,004,0002,523,136
5Dec 20, 2025 08:235,244195,777,914169,047,0004,001,0002,519,040
6Dec 20, 2025 08:235,265197,749,184168,766,0004,993,0002,342,912
7Dec 20, 2025 08:235,286200,419,379171,416,0003,007,0002,527,232
8Dec 20, 2025 08:235,377206,707,529171,445,0005,980,0002,449,408
9Dec 20, 2025 08:235,380207,443,613174,538,0002,992,0002,285,568