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 listJul 12, 2024 00:08Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2024 00:0800000Error: expected "1020296 ", got "1020295 "stderr
2Jul 12, 2024 00:0800000Error: expected "1020141 ", got "1024680 "stderr
3Jul 12, 2024 00:0800000Error: expected "1022652 ", got "1022651 "stderr
4Jul 12, 2024 00:083,715174,371,275122,591,48402,195,456
5Jul 12, 2024 00:083,837196,263,247126,631,66002,191,360
6Jul 12, 2024 00:083,838190,327,137126,646,63802,203,648