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 listAug 13, 2025 16:01Leon ZhaoLeon ZhaoScore: 15,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2025 16:0115,954554,351,482516,496,0009,990,0002,367,488
2Aug 13, 2025 16:0115,957554,602,706512,585,00013,988,0002,277,376
3Aug 13, 2025 16:0115,964550,626,460513,832,00012,995,0002,420,736