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 listJun 21, 2025 17:00Ian MckibbenIan MckibbenScore: 452,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2025 17:00451,51914,942,826,33514,806,181,00093,944,0002,494,464
2Jun 21, 2025 17:00452,48114,964,635,43114,843,926,00087,946,0002,260,992
3Jun 21, 2025 17:00452,72614,983,844,03614,840,019,00099,939,0002,396,160