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 listSep 26, 2024 14:54Yuriy LyfenkoYuriy LyfenkoScore: 8,885Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2024 14:548,872317,911,838287,795,0004,996,0002,478,080
2Sep 26, 2024 14:548,885319,003,157288,191,0005,003,0002,269,184
3Sep 26, 2024 14:548,930319,459,491288,705,0005,993,0002,367,488