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 listFeb 23, 2026 17:19Alexander KrivolapovAlexander KrivolapovScore: 95,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 17:1994,4643,149,897,6793,107,330,0009,994,0002,277,376
2Feb 23, 2026 17:1995,3643,178,397,0013,141,023,0005,996,0002,289,664
3Feb 23, 2026 17:1997,6173,249,549,9433,209,359,00011,993,0002,289,664