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 listFeb 7, 2025 21:25E SequeiraE SequeiraScore: 330,671Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2025 21:25328,63610,970,562,86510,380,287,000464,699,0002,469,888
2Feb 7, 2025 21:25330,67111,025,445,59210,473,490,000438,643,0002,252,800
3Feb 7, 2025 21:25331,46911,056,710,00810,488,828,000449,649,0002,310,144