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 22, 2026 08:34Dominique GarmierDominique GarmierScore: 196,580Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 08:34193,8606,430,816,4356,344,415,00052,970,0002,543,616
2Mar 22, 2026 08:34196,5806,513,525,8246,427,175,00059,964,0002,334,720
3Mar 22, 2026 08:34211,5087,071,653,2586,911,864,00067,900,0002,486,272