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 listNov 10, 2021 17:20Sergey StreminSergey StreminScore: 19,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2021 17:2019,293703,105,137636,680,67302,256,896
2Nov 10, 2021 17:1919,372711,930,070639,284,69802,273,280
3Nov 10, 2021 17:1919,399715,555,870640,181,77002,265,088
4Nov 10, 2021 17:2019,464700,152,889642,319,25802,277,376
5Nov 10, 2021 17:2019,479722,660,040642,792,02302,269,184
6Nov 10, 2021 17:1919,613722,598,176647,221,03202,269,184