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 listJul 31, 2026 18:38CodeReclaimersCodeReclaimersScore: 9,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 18:399,804334,330,212307,025,00016,521,0002,113,536
2Jul 31, 2026 18:399,805333,795,901307,037,00016,542,0002,113,536
3Jul 31, 2026 18:399,821334,232,183307,689,00016,413,0002,113,536
4Jul 31, 2026 18:399,830335,102,351307,718,00016,672,0002,113,536
5Jul 31, 2026 18:399,843335,664,355308,226,00016,618,0002,113,536
6Jul 31, 2026 18:399,855335,333,657308,592,00016,638,0002,113,536
7Jul 31, 2026 18:399,856335,943,603308,738,00016,524,0002,113,536
8Jul 31, 2026 18:399,880336,215,292309,250,00016,821,0002,113,536
9Jul 31, 2026 18:399,882337,016,453309,487,00016,649,0002,113,536