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 7, 2021 17:23Yurkov AlekseyYurkov AlekseyScore: 38,568Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2021 17:2238,4061,323,872,1361,267,405,46402,236,416
2Jun 7, 2021 17:2338,4521,327,836,2301,268,902,02402,248,704
3Jun 7, 2021 17:2238,4981,353,976,8731,270,431,28802,256,896
4Jun 7, 2021 17:2338,5681,337,253,7041,272,755,23702,244,608
5Jun 7, 2021 17:2238,6461,342,055,6301,275,323,29302,248,704
6Jun 7, 2021 17:2338,7051,342,903,9511,277,270,90402,248,704