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 listMay 23, 2021 02:38evgenikwtevgenikwtScore: 61,244Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2021 02:4858,6112,005,879,8591,934,169,57802,248,704
2May 23, 2021 02:4858,6451,998,471,4031,935,294,30602,252,800
3May 23, 2021 02:4858,7571,998,626,8241,938,982,07102,244,608
4May 23, 2021 02:3861,2442,083,119,5782,021,059,77102,260,992
5May 23, 2021 02:3861,3342,085,230,2962,024,008,10302,244,608
6May 23, 2021 02:3861,9212,104,580,4342,043,401,67302,252,800