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 listOct 6, 2023 12:19CadovvlCadovvlScore: 135,727Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 6, 2023 12:14134,7914,504,239,0324,448,104,79602,293,760
2Oct 6, 2023 12:14134,8504,514,168,1424,450,039,79102,293,760
3Oct 6, 2023 12:19134,9234,507,182,4784,452,449,86902,285,568
4Oct 6, 2023 12:14135,7274,547,858,2894,478,991,17502,301,952
5Oct 6, 2023 12:19137,0744,588,472,7544,523,426,79802,301,952
6Oct 6, 2023 12:19137,0834,589,183,0604,523,743,68302,293,760