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 listJun 22, 2025 16:38Ian MckibbenIan MckibbenScore: 15,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 16:3815,493544,043,924446,359,00064,906,0002,531,328
2Jun 22, 2025 16:3815,499538,889,493443,542,00067,929,0002,502,656
3Jun 22, 2025 16:3815,506532,435,370438,742,00072,957,0002,363,392
4Jun 22, 2025 16:3815,567535,932,679435,769,00077,958,0002,306,048
5Jun 22, 2025 16:3815,570538,818,279435,849,00077,973,0002,449,408
6Jun 22, 2025 16:3815,599537,125,889436,807,00077,965,0002,322,432
7Jun 22, 2025 16:3815,607543,585,744443,027,00072,004,0002,408,448
8Jun 22, 2025 16:3815,666541,847,960450,992,00065,998,0002,408,448
9Jun 22, 2025 16:3816,552573,616,559456,191,00090,037,0002,310,144