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 16, 2026 22:19Adam FolwarcznyAdam FolwarcznyScore: 10,715Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2026 22:2010,661373,303,621339,830,00011,994,0002,408,448
2Jan 16, 2026 22:1910,674375,951,016344,245,0008,005,0002,383,872
3Jan 16, 2026 22:2010,685375,447,606344,630,0007,991,0002,404,352
4Jan 16, 2026 22:1910,715386,195,035345,594,0007,990,0002,363,392
5Jan 16, 2026 22:2010,737381,752,877348,316,0006,005,0002,342,912
6Jan 16, 2026 22:1910,756382,709,102349,962,0004,999,0002,400,256