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 9, 2022 19:52Edoardo AnnunziataEdoardo AnnunziataScore: 267,341Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2022 19:52265,6378,824,424,1558,766,027,10602,248,704
2Aug 9, 2022 19:52267,3418,883,468,8948,822,246,74402,252,800
3Aug 9, 2022 19:52267,7108,911,847,7228,834,439,17102,244,608