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 listJun 9, 2021 15:45Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2021 16:0100000Error: expected "1033924 ", got "1033923 "
2Jun 9, 2021 16:0100000Error: expected "1039555 ", got "1039554 "
3Jun 9, 2021 16:0100000Error: expected "1040183 ", got "1040182 "
4Jun 9, 2021 16:0800000Error: expected "1037756 ", got "1037755 "
5Jun 9, 2021 16:1400000Error: expected "1041231 ", got "1041230 "
6Jun 9, 2021 15:4511,463432,984,175378,274,20502,240,512
7Jun 9, 2021 15:4511,463450,328,816378,277,76902,252,800
8Jun 9, 2021 15:4511,591441,567,179382,498,71202,252,800