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 12, 2025 15:19Rajarshi BasuRajarshi BasuScore: 11,285Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 12, 2025 15:1911,135391,907,527350,490,00016,975,0002,469,888
2Dec 12, 2025 15:1911,165396,513,927354,464,00013,978,0002,441,216
3Dec 12, 2025 15:1911,194392,675,938352,415,00016,971,0002,338,816
4Dec 12, 2025 15:1911,267397,851,657354,825,00016,991,0002,473,984
5Dec 12, 2025 15:1911,285401,644,769355,435,00016,973,0002,465,792
6Dec 12, 2025 15:1911,295398,257,013354,752,00017,987,0002,478,080
7Dec 12, 2025 15:1911,334396,691,363357,031,00017,001,0002,314,240
8Dec 12, 2025 15:1911,446409,056,166356,740,00020,984,0002,392,064
9Dec 12, 2025 15:1911,478403,499,866364,769,00013,991,0002,469,888