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 10, 2025 03:18nnScore: 233,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2025 03:18231,7427,673,684,6397,603,511,00043,974,0002,285,568
2May 10, 2025 03:18232,1917,695,490,7037,616,330,00045,971,0002,293,760
3May 10, 2025 03:18232,8977,714,165,5657,641,640,00043,974,0002,338,816
4May 10, 2025 03:18233,3167,728,206,2647,657,443,00041,975,0002,375,680
5May 10, 2025 03:18233,6247,745,113,8267,670,611,00038,977,0002,486,272
6May 10, 2025 03:18233,8967,754,215,8757,674,599,00043,969,0002,519,040
7May 10, 2025 03:18234,2707,762,261,2117,685,920,00044,976,0002,367,488
8May 10, 2025 03:18234,8017,782,844,9257,694,481,00053,961,0002,412,544
9May 10, 2025 03:18244,7028,111,008,5678,024,192,00050,969,0002,519,040