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 listJan 2, 2026 00:05zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 05:22Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 05:22011,521,5061,058,0002,280,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 05:22011,064,7101,061,0002,128,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 05:22011,043,5691,047,0002,113,0002,121,728expected "16384 ", got "349 "stderr
4Jan 2, 2026 00:053,490140,086,947114,184,0001,001,0002,420,736
5Jan 2, 2026 00:053,645145,379,368116,288,0004,009,0002,424,832
6Jan 2, 2026 00:053,717148,089,478118,668,0003,988,0002,408,448