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 15, 2026 22:47Adam FolwarcznyAdam FolwarcznyScore: 11,864Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2026 22:4711,777409,912,282369,648,00018,981,0002,392,064
2Jan 15, 2026 22:4011,789414,029,217376,051,00013,001,0002,379,776
3Jan 15, 2026 22:4011,864420,028,989374,518,00016,978,0002,379,776
4Jan 15, 2026 22:4011,864417,955,561376,541,00014,981,0002,379,776
5Jan 15, 2026 22:4711,945417,309,083378,173,00016,007,0002,379,776
6Jan 15, 2026 22:4711,948422,219,511377,263,00017,011,0002,445,312