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 listJun 17, 2024 12:46Joad NacerJoad NacerScore: 4,739Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2024 12:464,673227,409,142154,215,58602,211,840
2Jun 17, 2024 12:464,689217,529,935154,724,67802,211,840
3Jun 17, 2024 12:464,728212,730,178156,010,78402,351,104
4Jun 17, 2024 12:464,739215,195,835156,392,87302,220,032
5Jun 17, 2024 12:464,790219,219,132158,075,92902,215,936
6Jun 17, 2024 12:464,814227,926,165158,861,85002,342,912