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 11, 2025 20:16Rajarshi BasuRajarshi BasuScore: 14,118Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 20:1614,023490,666,427441,764,00020,988,0002,297,856
2Dec 11, 2025 20:1614,026487,597,785439,872,00022,993,0002,351,104
3Dec 11, 2025 20:1614,101493,228,748444,371,00020,970,0002,400,256
4Dec 11, 2025 20:1614,112499,705,660448,697,00016,988,0002,408,448
5Dec 11, 2025 20:1614,118493,856,697441,910,00023,995,0002,494,464
6Dec 11, 2025 20:1614,132496,205,937447,376,00018,973,0002,396,160
7Dec 11, 2025 20:1614,343503,797,293451,347,00021,968,0002,408,448
8Dec 11, 2025 20:1614,369501,210,710457,206,00016,970,0002,404,352
9Dec 11, 2025 20:1614,402499,881,496452,312,00022,965,0002,404,352