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 22, 2025 21:48zielajzielajScore: 4,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 21:484,251165,561,625125,251,00015,030,0002,367,488
2Dec 22, 2025 21:484,257166,921,686131,461,0009,031,0002,289,664
3Dec 22, 2025 21:484,263167,555,808124,703,00015,962,0002,334,720
4Dec 22, 2025 21:484,273168,555,678132,002,0009,000,0002,383,872
5Dec 22, 2025 21:484,281165,942,479130,257,00011,021,0002,338,816
6Dec 22, 2025 21:484,283162,882,557132,312,0009,021,0002,523,136
7Dec 22, 2025 21:484,298165,713,503132,855,0008,990,0002,351,104
8Dec 22, 2025 21:484,306161,975,322131,098,00011,008,0002,445,312
9Dec 22, 2025 21:484,318172,420,767132,541,0009,965,0002,371,584