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 listApr 27, 2021 06:35Dmitry DolgopolovDmitry DolgopolovError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2021 06:3500000Wrong answer: expected: 1037315 got: 1037314
2Apr 27, 2021 06:3800000Wrong answer: expected: 1035927 got: 1035925
3Apr 27, 2021 06:3800000Wrong answer: expected: 1036909 got: 1036907
4Apr 27, 2021 06:3900000Wrong answer: expected: 1034648 got: 1034647
5Apr 27, 2021 06:4000000Wrong answer: expected: 1037860 got: 1037859
6Apr 27, 2021 06:4000000Wrong answer: expected: 1034677 got: 1034674
7Apr 27, 2021 06:4100000Wrong answer: expected: 1038015 got: 1038012
8Apr 27, 2021 06:4100000Wrong answer: expected: 1042500 got: 1042494
9Apr 27, 2021 06:4200000Wrong answer: expected: 1037982 got: 1037979
10Apr 27, 2021 06:4300000Wrong answer: expected: 1035071 got: 1035070