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:16Leonardo Pedrozo AmaralLeonardo Pedrozo AmaralScore: 168,928Success
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:16167,3975,552,876,1705,373,166,000150,920,0002,277,376
2Jul 31, 2025 14:16168,9285,604,459,2165,439,697,000134,918,0002,277,376
3Jul 31, 2025 14:16174,8725,803,430,8005,639,838,000130,926,0002,277,376