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:12Dmitry 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:1200000Wrong answer: expected: 1040856 got: 1040855
2Apr 27, 2021 06:1300000Wrong answer: expected: 1039383 got: 1039384
3Apr 27, 2021 06:1300000Wrong answer: expected: 1040705 got: 1040707
4Apr 27, 2021 06:1300000Wrong answer: expected: 1041429 got: 1041424
5Apr 27, 2021 06:1300000Wrong answer: expected: 1034560 got: 1034550
6Apr 27, 2021 06:1300000Wrong answer: expected: 1037015 got: 1037012
7Apr 27, 2021 06:1300000Wrong answer: expected: 1037718 got: 1037716