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 5, 2025 11:01CadovvlCadovvlScore: 60,052Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2025 11:0159,9782,009,051,2061,964,277,00014,994,0002,277,376
2Dec 5, 2025 11:0160,0522,015,116,9881,969,720,00011,992,0002,457,600
3Dec 5, 2025 11:0160,1742,010,519,9831,968,763,00016,989,0002,375,680