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:48Mikhail MaximovMikhail MaximovScore: 428,652Success
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:48426,27714,143,971,54614,067,132,11302,273,280
2May 22, 2021 09:51426,69814,136,870,70414,081,046,31202,220,032
3May 22, 2021 09:51427,81114,175,995,61714,117,748,62102,228,224
4May 22, 2021 09:48428,65214,222,650,76514,145,515,40802,260,992
5May 22, 2021 09:48428,86414,222,792,21314,152,512,97402,248,704
6May 22, 2021 09:51430,76314,289,871,34914,215,181,81202,224,128