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 29, 2024 17:26Yuriy LyfenkoYuriy LyfenkoScore: 8,582Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2024 17:268,488300,115,998275,088,0005,001,0002,363,392
2Dec 29, 2024 17:258,528306,589,733274,420,0007,010,0002,514,944
3Dec 29, 2024 17:258,579304,330,168279,114,0004,001,0002,363,392
4Dec 29, 2024 17:268,582311,962,415279,192,0004,002,0002,281,472
5Dec 29, 2024 17:258,622319,996,531277,542,0006,988,0002,371,584
6Dec 29, 2024 17:268,670310,427,494278,111,0008,003,0002,281,472