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 listSep 9, 2024 16:18Jatin YadavJatin YadavScore: 60,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2024 16:1860,4062,020,355,4251,952,406,00040,987,0002,396,160
2Sep 9, 2024 16:1860,4762,019,902,5601,963,722,00031,979,0002,392,064
3Sep 9, 2024 16:1862,0712,074,007,7092,016,375,00031,974,0002,408,448