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 listJan 22, 2025 21:58Miriam VellacottMiriam VellacottScore: 101,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 21:58101,8993,391,202,3813,302,678,00059,975,0002,289,664
2Jan 22, 2025 21:58101,9433,389,855,0253,286,175,00077,956,0002,281,472
3Jan 22, 2025 21:58102,4473,409,138,5453,298,812,00081,945,0002,367,488