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 14, 2025 18:47izotoffizotoffScore: 237,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2025 18:47236,7587,843,002,6487,691,104,000121,922,0002,433,024
2Nov 14, 2025 18:47237,4647,862,073,5897,692,400,000143,913,0002,314,240
3Nov 14, 2025 18:47239,1217,925,290,5897,760,065,000130,916,0002,486,272