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 17, 2026 17:41Dominique GarmierDominique GarmierScore: 58,939Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 17:4158,7491,966,627,1951,925,722,00012,991,0002,289,664
2Mar 17, 2026 17:4158,9391,969,842,6681,929,008,00015,991,0002,281,472
3Mar 17, 2026 17:4160,1882,018,116,8741,970,224,00015,977,0002,285,568