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 listMay 25, 2025 00:51Emanuele BolognesiEmanuele BolognesiScore: 45,799Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2025 00:5144,6081,505,160,1461,454,082,00017,988,0002,277,376
2May 25, 2025 00:5145,7991,542,558,4101,496,359,00014,993,0002,445,312
3May 25, 2025 00:5146,1051,546,266,6831,507,461,00013,995,0002,297,856