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 21, 2025 13:26Cameron AavikCameron AavikScore: 32,492Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 13:2632,2031,088,786,7541,001,728,00060,983,0002,375,680
2Jan 21, 2025 13:2632,4921,103,244,3311,013,290,00058,958,0002,494,464
3Jan 21, 2025 13:2632,6961,103,172,9091,004,030,00074,927,0002,433,024