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 14:54Yuriy LyfenkoYuriy LyfenkoScore: 19,003Success
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 14:5418,828684,638,812621,321,80302,281,472
2May 22, 2021 14:5418,852678,435,492622,117,08902,269,184
3May 22, 2021 14:5418,970692,299,703626,003,06102,293,760
4May 22, 2021 14:5419,003701,873,957627,106,50302,281,472
5May 22, 2021 14:5419,832711,573,205654,451,23902,281,472
6May 22, 2021 14:5419,866716,083,089655,582,96902,277,376