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 9, 2025 09:50Ian MckibbenIan MckibbenScore: 310,577Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2025 09:50308,64010,217,074,39910,157,123,00027,983,0002,412,544
2Jan 9, 2025 09:50310,57710,286,556,85910,218,049,00030,981,0002,318,336
3Jan 9, 2025 09:50310,89910,296,592,09610,221,707,00037,976,0002,514,944