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 listSep 2, 2021 14:14Ilya AniskovetsIlya AniskovetsScore: 41,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2021 10:3140,2731,396,314,2441,329,016,13602,297,856
2Sep 2, 2021 10:3140,4911,389,904,5151,336,193,16502,232,320
3Sep 2, 2021 10:3140,5951,406,432,1311,339,628,99902,297,856
4Sep 2, 2021 14:1441,5581,429,945,3851,371,407,69602,260,992
5Sep 2, 2021 14:1441,7581,450,496,4761,378,011,04002,236,416
6Sep 2, 2021 14:1442,0211,444,323,2831,386,705,84602,187,264