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 25, 2021 12:44Kirill ButinKirill ButinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 25, 2021 12:4300000Error: expected "1023323 ", got "1023320 "stderr
2Nov 25, 2021 12:44102,5123,442,574,8013,382,900,89602,232,320
3Nov 25, 2021 12:44103,1453,466,685,7733,403,770,19902,240,512
4Nov 25, 2021 12:44103,4533,478,728,7353,413,958,74902,248,704