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 20, 2026 19:02Pavel SkripkinPavel SkripkinScore: 26,544Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 20, 2026 19:0222,475769,393,757738,689,0002,998,0002,297,856
2Jan 20, 2026 19:0226,544901,315,312872,956,0002,996,0002,543,616
3Jan 20, 2026 19:0227,285927,520,795897,404,0002,998,0002,293,760