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 4, 2021 17:32Yuriy LyfenkoYuriy LyfenkoScore: 22,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2021 17:3222,3201,807,306,554736,551,58902,306,048
2Jun 4, 2021 17:3222,4921,807,240,339742,220,20902,310,144
3Jun 4, 2021 17:3222,8791,825,787,169754,996,33802,306,048
4Jun 4, 2021 17:3222,9301,821,811,800756,674,13302,306,048
5Jun 4, 2021 17:3222,9481,826,005,878757,270,22102,306,048
6Jun 4, 2021 17:3223,0581,827,105,076760,900,94702,306,048