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 listDec 18, 2022 19:54Franek KortaFranek KortaScore: 19,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 18, 2022 19:5219,787708,505,980652,982,10702,285,568
2Dec 18, 2022 19:5219,804716,121,386653,515,78902,285,568
3Dec 18, 2022 19:5219,810717,849,393653,739,85502,281,472
4Dec 17, 2022 23:3619,827712,484,073654,276,28302,293,760
5Dec 17, 2022 23:3619,830707,139,582654,394,94302,297,856
6Dec 18, 2022 19:5420,101719,843,535663,338,68802,289,664
7Dec 18, 2022 19:5420,120721,991,079663,966,16902,285,568
8Dec 18, 2022 19:5420,127740,400,765664,204,87102,277,376
9Dec 17, 2022 23:3620,274722,062,942669,054,19602,289,664