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 25, 2026 22:35Dominique GarmierDominique GarmierScore: 50,247Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 22:3549,3581,659,232,6621,619,816,0008,998,0002,375,680
2Mar 25, 2026 22:3550,2471,682,119,9601,648,155,0009,994,0002,371,584
3Mar 25, 2026 22:3551,4091,720,327,6501,686,496,0009,991,0002,527,232