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 listMay 22, 2021 09:55Mikhail MaximovMikhail MaximovScore: 428,642Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2021 09:55426,55914,138,252,27714,076,447,81202,215,936
2May 22, 2021 09:29426,67214,138,652,63714,080,162,75002,244,608
3May 22, 2021 09:29427,12014,161,874,42414,094,965,21802,203,648
4May 22, 2021 09:55428,64214,210,083,71214,145,194,73502,252,800
5May 22, 2021 09:29430,56814,309,879,86414,208,746,17502,211,840
6May 22, 2021 09:55432,29714,329,418,13514,265,795,57202,183,168