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 09:09Rajarshi BasuRajarshi BasuScore: 5,214Success
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 09:095,170198,632,422164,638,0005,986,0002,498,560
2Dec 20, 2025 09:095,199194,644,349164,594,0006,982,0002,342,912
3Dec 20, 2025 09:095,210202,416,891164,927,0006,996,0002,514,944
4Dec 20, 2025 09:095,212196,299,348168,011,0004,000,0002,383,872
5Dec 20, 2025 09:095,214195,323,805166,053,0006,001,0002,465,792
6Dec 20, 2025 09:095,223198,623,261167,358,0005,010,0002,461,696
7Dec 20, 2025 09:095,231197,587,171164,652,0007,983,0002,322,432
8Dec 20, 2025 09:095,233198,576,214164,716,0007,986,0002,519,040
9Dec 20, 2025 09:095,248195,067,648167,183,0006,006,0002,347,008