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 5, 2025 11:00CadovvlCadovvlScore: 56,208Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2025 11:0055,8681,881,453,9031,832,659,00010,991,0002,428,928
2Dec 5, 2025 11:0055,9781,873,902,0941,837,275,0009,996,0002,445,312
3Dec 5, 2025 11:0056,1271,879,491,1491,843,186,0008,996,0002,457,600
4Dec 5, 2025 11:0056,1341,877,936,1911,843,422,0008,997,0002,445,312
5Dec 5, 2025 11:0056,2081,883,331,3371,842,860,00011,992,0002,277,376
6Dec 5, 2025 11:0056,3241,891,464,6361,845,712,00012,990,0002,277,376
7Dec 5, 2025 11:0056,3621,893,249,0431,846,945,00012,992,0002,445,312
8Dec 5, 2025 11:0056,4121,891,246,3731,851,616,0009,992,0002,416,640
9Dec 5, 2025 11:0056,4491,892,634,5641,847,822,00014,990,0002,441,216