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:13Yurkov AlekseyYurkov AlekseyScore: 38,572Success
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:1438,3321,315,244,5761,264,948,32902,240,512
2Jun 7, 2021 17:1438,5041,341,501,7231,270,621,45102,256,896
3Jun 7, 2021 17:1338,5301,323,614,3721,271,488,98602,248,704
4Jun 7, 2021 17:1438,5721,339,461,7451,272,864,57402,252,800
5Jun 7, 2021 17:1338,5861,331,806,1181,273,352,62702,252,800
6Jun 7, 2021 17:1338,6071,344,713,1161,274,038,87902,252,800