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 26, 2025 16:01zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 09:20Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 09:20012,262,8162,130,0002,213,0002,121,728expected "16384 ", got "772 "stderr
2Jul 5, 2026 09:20012,135,3052,126,0002,167,0002,121,728expected "16384 ", got "772 "stderr
3Jul 5, 2026 09:20012,180,3822,126,0002,182,0002,121,728expected "16384 ", got "772 "stderr
4Dec 26, 2025 16:013,772151,034,657111,422,00013,049,0002,387,968
5Dec 26, 2025 16:013,772151,341,978114,453,00010,039,0002,379,776
6Dec 26, 2025 16:013,778155,121,634117,705,0006,982,0002,359,296