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 23, 2025 10:39Aniruddha DebAniruddha DebScore: 85,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2025 10:3983,2492,774,941,1162,687,270,00059,961,0002,314,240
2Mar 23, 2025 10:3985,2222,841,694,9012,755,365,00056,966,0002,297,856
3Mar 23, 2025 10:3985,2392,851,528,7822,744,936,00067,948,0002,306,048