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 07:03evgenikwtevgenikwtScore: 60,975Success
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 07:1658,4211,983,254,6791,927,905,10802,224,128
2May 23, 2021 07:0358,6752,004,036,6011,936,280,39202,252,800
3May 23, 2021 07:1660,6512,077,944,3022,001,478,02402,260,992
4May 23, 2021 07:0360,9752,073,333,5392,012,186,77802,256,896
5May 23, 2021 07:0361,0872,093,228,9062,015,867,93302,244,608
6May 23, 2021 07:1661,4282,089,241,1382,027,133,94802,252,800