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 08:04Rajarshi BasuRajarshi BasuScore: 5,034Success
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 08:044,978185,837,534160,275,0004,006,0002,510,848
2Dec 22, 2025 08:044,979190,007,388160,284,0004,007,0002,510,848
3Dec 22, 2025 08:044,990191,919,032158,678,0005,987,0002,428,928
4Dec 22, 2025 08:045,020193,001,316162,651,0002,993,0002,301,952
5Dec 22, 2025 08:045,034187,343,809161,105,0005,003,0002,510,848
6Dec 22, 2025 08:045,035194,761,501162,158,0004,003,0002,519,040
7Dec 22, 2025 08:045,053192,954,828163,764,0002,995,0002,314,240
8Dec 22, 2025 08:045,090193,350,304160,982,0006,999,0002,469,888
9Dec 22, 2025 08:045,217197,163,191166,164,0006,005,0002,375,680