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 listOct 14, 2021 22:21Yurkov AlekseyYurkov AlekseyScore: 37,106Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2021 22:2035,8291,249,247,1521,182,355,60202,252,800
2Oct 14, 2021 22:2036,2311,267,340,3931,195,607,38302,248,704
3Oct 14, 2021 22:2136,8521,276,171,6961,216,110,79902,256,896
4Oct 14, 2021 22:2037,1061,295,049,2161,224,498,29702,256,896
5Oct 14, 2021 22:2137,1781,312,830,1431,226,879,65402,248,704
6Oct 14, 2021 22:2139,2911,372,673,0501,296,589,12202,252,800