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 15:06zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:00Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:00011,691,8042,620,0001,309,0002,125,824expected "16384 ", got "349 "stderr
2Jul 5, 2026 13:00011,678,0762,639,0001,319,0002,125,824expected "16384 ", got "349 "stderr
3Jul 5, 2026 13:00011,612,2751,886,0001,886,0002,121,728expected "16384 ", got "349 "stderr
4Dec 26, 2025 15:064,006157,022,642121,181,00011,016,0002,318,336
5Dec 26, 2025 15:064,009152,994,993121,263,00011,023,0002,297,856
6Dec 26, 2025 15:064,034163,496,364118,114,00015,014,0002,408,448