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 listMar 22, 2026 22:10Dominique GarmierDominique GarmierScore: 34,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 22:1034,4741,165,330,2861,129,640,0007,990,0002,510,848
2Mar 22, 2026 22:1034,6901,167,686,2531,138,763,0005,993,0002,273,280
3Mar 22, 2026 22:1034,9791,183,900,7671,143,313,00010,983,0002,449,408