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 listAug 28, 2022 08:11Bernard TeoBernard TeoScore: 10,427Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2022 08:1110,315406,783,520340,387,40902,252,800
2Aug 28, 2022 08:1110,342400,481,487341,273,66102,244,608
3Aug 28, 2022 08:1110,379398,383,491342,503,02102,256,896
4Aug 28, 2022 08:1110,427411,749,236344,099,72202,252,800
5Aug 28, 2022 08:1110,428423,890,419344,116,55902,248,704
6Aug 28, 2022 08:1110,642414,278,272351,176,57102,248,704