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 listMay 1, 2026 08:26Dominique GarmierDominique GarmierScore: 13,274Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 08:2713,178451,859,678432,884,0001,999,0002,457,600
2May 1, 2026 08:2713,192455,175,364431,358,0003,994,0002,453,504
3May 1, 2026 08:2713,222452,548,714430,357,0005,991,0002,351,104
4May 1, 2026 08:2713,232453,148,024431,667,0004,996,0002,449,408
5May 1, 2026 08:2713,274456,436,803435,065,0003,000,0002,465,792
6May 1, 2026 08:2713,276457,773,433434,103,0004,010,0002,461,696
7May 1, 2026 08:2713,294456,317,520432,715,0005,996,0002,453,504
8May 1, 2026 08:2713,394458,796,401438,021,0004,000,0002,355,200
9May 1, 2026 08:2713,485460,248,555439,018,0006,000,0002,461,696