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 19, 2021 18:33Yuriy LyfenkoYuriy LyfenkoScore: 18,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2021 18:3318,3264,535,538,380604,753,86702,244,608
2May 19, 2021 18:3318,3605,263,214,992605,867,86402,252,800
3May 19, 2021 18:3318,4865,729,836,331610,041,79702,244,608
4May 19, 2021 18:3318,5086,548,033,236610,759,66802,244,608
5May 19, 2021 18:3319,4996,139,972,427643,466,16602,248,704
6May 19, 2021 18:3319,5006,136,022,168643,494,81702,273,280