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 listJan 1, 2026 17:07zielajzielajScore: 3,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 17:073,492139,533,450114,245,0001,002,0002,408,448
2Jan 1, 2026 17:073,541136,320,458114,855,0001,997,0002,269,184
3Jan 1, 2026 17:073,549136,351,876116,117,0001,001,0002,502,656
4Jan 1, 2026 17:073,560143,173,056115,475,0002,008,0002,416,640
5Jan 1, 2026 17:073,573139,907,728116,902,000999,0002,449,408
6Jan 1, 2026 17:073,574139,908,867115,955,0001,999,0002,506,752