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 08:59izotoffizotoffScore: 272,394Success
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 08:59270,1318,942,905,2008,766,410,000147,922,0002,412,544
2Nov 6, 2025 08:59272,3949,021,896,3638,844,070,000144,919,0002,289,664
3Nov 6, 2025 08:59276,4479,153,925,0348,978,834,000143,901,0002,387,968