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 30, 2025 07:38Rajarshi BasuRajarshi BasuScore: 583,907Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 07:38575,52219,030,867,33218,930,274,00061,961,0002,457,600
2Dec 30, 2025 07:38583,90719,304,005,14419,210,970,00057,963,0002,531,328
3Dec 30, 2025 07:38588,80619,476,222,03119,367,657,00062,956,0002,494,464