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 listDec 1, 2022 05:37Yuriy LyfenkoYuriy LyfenkoScore: 219,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 1, 2022 05:37219,0677,282,669,4247,229,199,99502,277,376
2Dec 1, 2022 05:37219,2897,294,185,4637,236,538,33602,256,896
3Dec 1, 2022 05:37220,3167,333,468,2397,270,438,41902,289,664