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 29, 2025 18:06zielajzielajScore: 3,676Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 18:063,652144,107,128112,485,0008,034,0002,334,720
2Dec 29, 2025 18:063,656144,201,970109,682,00010,968,0002,375,680
3Dec 29, 2025 18:063,657143,907,794109,716,00010,971,0002,383,872
4Dec 29, 2025 18:063,664147,220,979112,917,0007,994,0002,473,984
5Dec 29, 2025 18:063,676148,899,389111,271,00010,024,0002,412,544
6Dec 29, 2025 18:063,687146,272,469112,699,0008,976,0002,502,656
7Dec 29, 2025 18:063,689144,925,810112,757,0008,980,0002,371,584
8Dec 29, 2025 18:063,689145,882,314111,772,0009,979,0002,387,968
9Dec 29, 2025 18:063,702147,413,375112,162,00010,014,0002,392,064