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 listJul 2, 2023 21:48serdarssserdarssScore: 469,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2023 21:49463,34315,343,493,20015,290,309,81102,297,856
2Jul 2, 2023 21:48465,15015,424,972,98515,349,962,03502,236,416
3Jul 2, 2023 21:49465,43615,426,746,93915,359,390,97202,314,240
4Jul 2, 2023 21:49469,45515,565,419,05815,492,005,45702,310,144
5Jul 2, 2023 21:48470,31815,585,260,52615,520,505,39702,207,744
6Jul 2, 2023 21:48481,50915,952,468,28115,889,802,19602,244,608