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:29E SequeiraE SequeiraScore: 114,701Success
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:29113,7153,785,161,5293,736,621,00015,989,0002,277,376
2Feb 7, 2025 21:29114,7013,814,955,6763,775,154,0009,992,0002,301,952
3Feb 7, 2025 21:29115,5183,845,403,0083,801,094,00010,991,0002,457,600