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 listJul 25, 2026 17:59boop34boop34Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2026 17:590525,214,852511,312,0003,264,0002,113,536expected "1021469 ", got "1021331 "
2Jul 25, 2026 17:590530,369,457516,242,0004,222,0002,113,536expected "1026222 ", got "1026105 "
3Jul 25, 2026 17:590525,249,033510,898,0004,369,0002,113,536expected "1026068 ", got "1025959 "