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 listDec 17, 2022 14:39Franek KortaFranek KortaScore: 21,490Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 17, 2022 15:0021,376755,180,083705,392,39702,220,032
2Dec 17, 2022 15:0021,403756,046,931706,296,13402,199,552
3Dec 17, 2022 15:0021,483795,903,546708,940,49802,215,936
4Dec 17, 2022 14:3921,490761,859,042709,159,25002,224,128
5Dec 17, 2022 14:3921,530767,748,528710,487,33602,220,032
6Dec 17, 2022 14:3921,821782,040,930720,082,88702,215,936