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:17CadovvlCadovvlScore: 40,712Success
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:1740,4581,364,642,0061,291,099,00044,003,0002,527,232
2Dec 5, 2025 11:1740,5301,369,205,6371,296,494,00040,984,0002,392,064
3Dec 5, 2025 11:1740,6121,367,601,6421,293,236,00046,972,0002,338,816
4Dec 5, 2025 11:1740,6401,370,884,1311,301,138,00039,973,0002,424,832
5Dec 5, 2025 11:1740,7121,369,848,4411,298,528,00044,983,0002,416,640
6Dec 5, 2025 11:1740,8251,371,672,2361,296,240,00050,970,0002,523,136
7Dec 5, 2025 11:1740,9561,376,986,6211,310,567,00040,986,0002,260,992
8Dec 5, 2025 11:1741,1311,380,170,0541,311,342,00045,976,0002,277,376
9Dec 5, 2025 11:1741,3631,392,532,5641,319,007,00045,965,0002,326,528