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 listDec 20, 2025 13:43Rajarshi BasuRajarshi BasuScore: 5,097Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 13:435,054193,702,827163,777,0002,995,0002,510,848
2Dec 20, 2025 13:435,054197,333,705160,791,0005,992,0002,519,040
3Dec 20, 2025 13:435,086195,471,814160,861,0006,993,0002,322,432
4Dec 20, 2025 13:435,092191,326,069165,036,0003,000,0002,510,848
5Dec 20, 2025 13:435,097197,534,835162,192,0006,007,0002,367,488
6Dec 20, 2025 13:435,101193,754,089163,360,0004,980,0002,510,848
7Dec 20, 2025 13:435,104195,697,473161,425,0007,018,0002,387,968
8Dec 20, 2025 13:435,110194,975,229161,657,0006,985,0002,519,040
9Dec 20, 2025 13:435,273195,820,818167,001,0007,000,0002,498,560