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 listNov 6, 2025 09:49izotoffizotoffScore: 238,729Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2025 09:49238,2057,888,948,0767,745,834,000114,923,0002,449,408
2Nov 6, 2025 09:49238,7297,907,243,8957,733,139,000144,908,0002,502,656
3Nov 6, 2025 09:49241,5768,001,057,7417,850,113,000121,908,0002,404,352