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 22, 2025 05:55Ian MckibbenIan MckibbenScore: 18,646Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 05:5518,543634,216,393518,924,00092,986,0002,494,464
2Jun 22, 2025 05:5518,574635,165,335539,938,00072,991,0002,338,816
3Jun 22, 2025 05:5518,624636,874,696535,651,00078,948,0002,375,680
4Jun 22, 2025 05:5518,627639,765,498540,729,00073,962,0002,510,848
5Jun 22, 2025 05:5518,646639,073,406532,404,00082,907,0002,285,568
6Jun 22, 2025 05:5518,650639,883,579527,540,00087,923,0002,285,568
7Jun 22, 2025 05:5518,703644,103,617532,307,00084,889,0002,306,048
8Jun 22, 2025 05:5518,733643,875,303530,311,00087,885,0002,269,184
9Jun 22, 2025 05:5519,049654,308,058542,656,00085,945,0002,539,520