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 23, 2025 16:07Ian MckibbenIan MckibbenScore: 142,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 16:07141,5734,703,845,7574,644,930,00026,982,0002,371,584
2Jun 23, 2025 16:07142,1014,722,893,9604,663,346,00025,985,0002,338,816
3Jun 23, 2025 16:07142,6364,734,123,1664,684,007,00022,985,0002,473,984