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 9, 2025 23:42nnScore: 492,547Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2025 23:42488,94916,170,890,89316,011,414,000123,918,0002,371,584
2May 9, 2025 23:42489,11816,175,125,13316,043,943,00096,939,0002,416,640
3May 9, 2025 23:42491,45716,259,552,69416,108,150,000109,939,0002,519,040
4May 9, 2025 23:42491,99516,267,675,28216,139,887,00095,945,0002,482,176
5May 9, 2025 23:42492,54716,294,616,55616,148,109,000105,935,0002,482,176
6May 9, 2025 23:42492,89816,301,051,10016,176,697,00088,948,0002,347,008
7May 9, 2025 23:42495,25016,382,644,63516,264,312,00078,948,0002,289,664
8May 9, 2025 23:42497,07216,435,688,52616,301,455,000101,934,0002,469,888
9May 9, 2025 23:42497,52816,459,219,93016,339,479,00078,949,0002,392,064