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 listAug 21, 2022 15:51Bernard TeoBernard TeoScore: 19,607Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2022 15:1019,418702,079,436640,782,21802,248,704
2Aug 21, 2022 15:1019,470700,465,502642,494,64102,244,608
3Aug 21, 2022 15:1019,584703,049,867646,260,78702,240,512
4Aug 21, 2022 15:5119,607704,029,517647,035,39902,244,608
5Aug 21, 2022 15:5119,619716,359,379647,442,93902,252,800
6Aug 21, 2022 15:5119,693706,577,201649,877,85402,240,512