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 16:45zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 08:50Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 08:580356,994,305230,478,000117,800,0002,121,728expected "2919934 ", got "1492221 "stderr
2Sep 9, 2026 08:580361,558,943232,101,000119,610,0002,121,728expected "2919925 ", got "1492098 "stderr
3Sep 9, 2026 08:580360,964,559233,631,000118,675,0002,121,728expected "2919940 ", got "1492384 "stderr
4Dec 22, 2025 16:458,326304,151,171160,856,000113,898,0002,281,472
5Dec 22, 2025 16:458,328299,380,489156,898,000117,923,0002,424,832
6Dec 22, 2025 16:458,460310,979,898158,099,000121,076,0002,494,464