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 listJan 4, 2026 22:02Павел РатмановПавел РатмановScore: 116,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 4, 2026 22:02115,8163,863,171,3063,792,951,00028,984,0002,482,176
2Jan 4, 2026 22:02116,7753,886,216,4313,828,595,00024,984,0002,478,080
3Jan 4, 2026 22:02118,8433,951,295,9253,895,845,00025,985,0002,265,088