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 07:27Jatin YadavJatin YadavScore: 90,651Success
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 07:2790,3363,009,428,7412,944,115,00036,976,0002,281,472
2Sep 9, 2024 07:2790,6513,016,661,2802,956,500,00034,982,0002,416,640
3Sep 9, 2024 07:2793,4233,114,408,4343,048,993,00033,977,0002,400,256