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:41Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 31, 2026 16:24Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 16:55078,785,98646,526,0008,717,00016,384Exit with code 1:
2Dec 11, 2025 20:4113,921491,653,379444,405,00014,979,0002,297,856
3Dec 11, 2025 20:4113,944491,077,085450,143,00010,003,0002,519,040
4Dec 11, 2025 20:4113,978493,510,613451,273,00010,006,0002,482,176
5Dec 11, 2025 20:4113,993490,211,227451,776,0009,995,0002,338,816
6Dec 11, 2025 20:4114,053492,124,860452,740,00010,993,0002,469,888
7Dec 11, 2025 20:4114,065492,304,483450,128,00014,004,0002,453,504
8Dec 11, 2025 20:4114,137495,899,927455,517,00010,988,0002,330,624
9Dec 11, 2025 20:4114,509507,949,506469,827,0008,977,0002,486,272
10Dec 11, 2025 20:4114,510504,842,526466,864,00011,970,0002,478,080