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:26Jatin YadavJatin YadavScore: 93,170Success
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:2690,3443,005,403,3352,948,377,00032,981,0002,416,640
2Sep 9, 2024 07:2693,1703,104,381,0173,043,625,00030,975,0002,416,640
3Sep 9, 2024 07:2699,2083,305,248,4473,245,867,00027,981,0002,281,472