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 listJun 8, 2021 05:29Sergey StreminSergey StreminScore: 28,158Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2021 05:5027,686981,417,662913,635,50102,301,952
2Jun 8, 2021 05:5027,754977,321,985915,882,51102,281,472
3Jun 8, 2021 05:5027,881998,802,792920,061,03602,285,568
4Jun 8, 2021 05:2928,1581,008,338,648929,208,37202,289,664
5Jun 8, 2021 05:2928,3221,000,790,496934,613,36302,285,568
6Jun 8, 2021 05:2928,3721,006,923,503936,279,56002,281,472