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 21, 2026 02:42Dominique GarmierDominique GarmierScore: 139,818Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 02:42139,4654,628,954,5064,596,338,0005,996,0002,469,888
2Mar 21, 2026 02:42139,8184,639,554,4954,607,986,0005,996,0002,281,472
3Mar 21, 2026 02:42147,0174,908,834,7434,843,583,0007,994,0002,273,280