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 24, 2025 20:05zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:08Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:08011,025,5501,614,0001,614,0002,121,728expected "16384 ", got "32 "stderr
2Jul 5, 2026 12:08011,031,6221,653,0001,652,0002,121,728expected "16384 ", got "32 "stderr
3Jul 5, 2026 12:08010,995,2391,636,0001,635,0002,121,728expected "16384 ", got "32 "stderr
4Dec 24, 2025 20:053,930157,702,448122,699,0006,982,0002,408,448
5Dec 24, 2025 20:053,947154,015,337119,224,00011,020,0002,383,872
6Dec 24, 2025 20:053,972158,788,845116,058,00015,007,0002,473,984