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 13, 2026 14:24Dominique GarmierDominique GarmierScore: 326,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 14:24326,47510,812,797,82610,739,700,00033,983,0002,453,504
2Mar 13, 2026 14:24326,79510,823,121,94210,747,257,00036,976,0002,494,464
3Mar 13, 2026 14:24328,94810,892,243,34910,820,314,00034,978,0002,424,832