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 09:34Rajarshi BasuRajarshi BasuScore: 5,035Success
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 09:345,010195,898,983160,309,0005,009,0002,387,968
2Dec 22, 2025 09:345,022189,094,851158,736,0006,988,0002,416,640
3Dec 22, 2025 09:345,024193,179,903160,795,0004,993,0002,482,176
4Dec 22, 2025 09:345,035192,919,839160,139,0006,005,0002,519,040
5Dec 22, 2025 09:345,035191,939,221161,163,0005,005,0002,523,136
6Dec 22, 2025 09:345,037191,178,615160,213,0006,007,0002,510,848
7Dec 22, 2025 09:345,049197,048,819160,641,0005,986,0002,523,136
8Dec 22, 2025 09:345,056188,602,978163,852,0002,997,0002,506,752
9Dec 22, 2025 09:345,228206,756,204167,542,0004,986,0002,519,040