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 listJan 22, 2025 22:04Miriam VellacottMiriam VellacottScore: 535,453Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 22:04532,85817,630,054,57517,486,412,00097,901,0002,383,872
2Jan 22, 2025 22:04535,45317,715,671,96017,570,053,00099,909,0002,269,184
3Jan 22, 2025 22:04568,97618,828,468,92918,682,348,00093,876,0002,285,568