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 23, 2021 01:52evgenikwtevgenikwtError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2021 00:1200000Wrong answer: expected "1040492 ", got "1040491"
2May 23, 2021 00:3763,7732,182,763,7002,104,498,41302,240,512
3May 23, 2021 00:3763,9892,171,125,0002,111,642,34602,240,512
4May 23, 2021 01:5263,9902,170,085,7182,111,665,13102,236,416
5May 23, 2021 00:3764,2192,188,248,8512,119,235,43402,244,608
6May 23, 2021 01:5264,3442,189,442,2252,123,366,48002,236,416
7May 23, 2021 01:5265,0142,200,625,5002,145,462,98702,240,512