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 14:54zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 10:20Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 10:20012,343,6452,187,0002,415,0002,121,728expected "16384 ", got "857 "stderr
2Jul 5, 2026 10:20012,354,2662,187,0002,430,0002,121,728expected "16384 ", got "857 "stderr
3Jul 5, 2026 10:20012,271,9472,127,0002,192,0002,121,728expected "16384 ", got "857 "stderr
4Dec 26, 2025 14:543,819152,505,971117,015,0009,001,0002,445,312
5Dec 26, 2025 14:543,834151,675,266116,468,00010,040,0002,461,696
6Dec 26, 2025 14:543,845153,579,169120,891,0005,994,0002,383,872