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 listJul 31, 2025 14:20Leonardo Pedrozo AmaralLeonardo Pedrozo AmaralScore: 164,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2025 14:20162,9495,400,099,0505,250,376,000126,936,0002,277,376
2Jul 31, 2025 14:20164,5005,456,568,4295,305,590,000122,920,0002,277,376
3Jul 31, 2025 14:20170,3215,649,569,9475,480,682,000139,915,0002,277,376