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 22, 2025 10:30Rajarshi BasuRajarshi BasuScore: 4,937Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 10:304,870189,734,937156,709,0003,992,0002,510,848
2Dec 22, 2025 10:304,898187,538,630157,656,0003,991,0002,293,760
3Dec 22, 2025 10:304,906185,070,817157,898,0003,997,0002,330,624
4Dec 22, 2025 10:304,913190,612,136158,115,0004,002,0002,293,760
5Dec 22, 2025 10:304,920189,253,201158,343,0004,008,0002,445,312
6Dec 22, 2025 10:304,933188,558,090158,789,0003,994,0002,338,816
7Dec 22, 2025 10:304,937185,058,633158,931,0003,998,0002,519,040
8Dec 22, 2025 10:304,941186,848,668159,046,0004,001,0002,523,136
9Dec 22, 2025 10:304,942185,992,907159,099,0004,002,0002,277,376
10Dec 22, 2025 10:305,050192,379,366162,672,0003,991,0002,510,848
11Dec 22, 2025 10:305,105193,132,094164,489,0003,987,0002,510,848
12Dec 22, 2025 10:305,342201,175,265172,266,0004,006,0002,293,760