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 4, 2023 13:06АндрейАндрейScore: 78,345Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2023 12:5677,6192,625,275,4792,561,421,07002,203,648
2Jun 4, 2023 12:5677,9602,653,757,3702,572,682,11802,211,840
3Jun 4, 2023 13:0678,1342,642,115,7262,578,413,75302,207,744
4Jun 4, 2023 13:0678,3452,650,012,2332,585,398,58702,195,456
5Jun 4, 2023 12:5678,5042,659,644,5602,590,624,83802,199,552
6Jun 4, 2023 13:0683,7402,829,807,3332,763,406,93602,199,552