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 12, 2026 21:28Adam FolwarcznyAdam FolwarcznyScore: 76,810Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 21:2876,7052,561,401,8302,523,263,0007,994,0002,310,144
2Jan 12, 2026 21:2876,8102,566,481,0262,520,727,00013,992,0002,510,848
3Jan 12, 2026 21:2877,0812,571,196,1962,532,667,00010,994,0002,510,848