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 listMar 13, 2026 15:55Dominique GarmierDominique GarmierScore: 326,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 15:55326,34810,800,581,98110,735,491,00033,982,0002,371,584
2Mar 13, 2026 15:55326,64310,815,949,97110,755,242,00023,987,0002,396,160
3Mar 13, 2026 15:55329,11110,897,187,82210,837,677,00022,986,0002,433,024