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 23, 2025 17:28Ian MckibbenIan MckibbenScore: 29,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 17:2829,211987,456,070810,117,000153,832,0002,461,696
2Jun 24, 2025 21:5329,265993,806,607828,787,000136,964,0002,457,600
3Jun 24, 2025 21:5329,267989,628,387807,995,000157,803,0002,347,008
4Jun 23, 2025 17:2829,284995,074,709811,486,000154,901,0002,461,696
5Jun 23, 2025 17:2829,301998,291,030802,123,000164,819,0002,371,584
6Jun 24, 2025 21:5329,329996,996,847812,045,000155,816,0002,416,640