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 listDec 17, 2022 14:30Franek KortaFranek KortaScore: 39,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 17, 2022 14:2938,6504,814,067,2821,275,434,43904,235,264
2Dec 17, 2022 14:2938,7244,884,425,4231,277,882,55503,063,808
3Dec 17, 2022 14:3039,0465,167,184,1991,288,512,32702,355,200
4Dec 17, 2022 14:3039,2976,160,833,4851,296,800,28102,588,672
5Dec 17, 2022 14:2939,5705,362,290,7051,305,793,65502,277,376
6Dec 17, 2022 14:3040,1026,017,518,7001,323,366,83002,203,648