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 29, 2022 12:51Bernard TeoBernard TeoScore: 10,506Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2022 12:5110,447407,104,795344,739,19902,277,376
2Aug 29, 2022 12:5110,481398,109,708345,857,58302,273,280
3Aug 29, 2022 12:5110,495414,724,508346,349,71702,269,184
4Aug 29, 2022 12:5110,506434,633,013346,697,08602,281,472
5Aug 29, 2022 12:5110,522412,723,223347,211,19502,281,472
6Aug 29, 2022 12:5110,657419,636,081351,693,59002,285,568