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 30, 2024 07:24Павел РатмановПавел РатмановScore: 288,509Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2024 07:24284,9489,460,721,6059,403,285,41502,256,896
2Jul 30, 2024 07:24286,2709,504,105,9629,446,926,36402,269,184
3Jul 30, 2024 07:24286,3219,520,523,2329,448,588,22202,289,664
4Jul 30, 2024 07:24288,5099,590,992,3439,520,802,12902,314,240
5Jul 30, 2024 07:24289,9699,625,243,9599,568,991,90202,203,648
6Jul 30, 2024 07:24291,0999,668,346,1139,606,256,68502,232,320