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 listSep 29, 2022 08:01PhibPhibError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2022 08:0000000Error: Killed by timeout
2Sep 29, 2022 08:01101,3493,419,804,2803,344,507,30702,240,512
3Sep 29, 2022 08:01101,4833,422,716,4543,348,954,95002,240,512
4Sep 29, 2022 08:01101,8193,435,667,8043,360,042,78002,240,512