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 1, 2026 14:57Alexander KrivolapovAlexander KrivolapovScore: 51,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 1, 2026 14:5751,0691,714,757,7851,679,271,0005,997,0002,367,488
2Mar 1, 2026 14:5751,2071,718,875,5281,682,829,0006,995,0002,408,448
3Mar 1, 2026 14:5751,3111,724,658,0521,684,270,0008,996,0002,289,664