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 20, 2025 11:34Oleg KovalovOleg KovalovScore: 113,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2025 11:34113,8133,781,013,6483,742,837,00012,992,0002,330,624
2Feb 20, 2025 11:34113,9303,792,071,4463,744,699,00014,990,0002,478,080
3Feb 20, 2025 11:34119,6393,980,709,1903,932,093,00015,992,0002,330,624