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 19:33zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 18:29Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 18:29010,915,3301,044,0002,116,0002,121,728expected "16384 ", got "353 "stderr
2Jul 4, 2026 18:29010,971,9751,530,0001,531,0002,121,728expected "16384 ", got "353 "stderr
3Jul 4, 2026 18:29010,979,9121,519,0001,519,0002,121,728expected "16384 ", got "353 "stderr
4Jan 2, 2026 19:333,307132,237,276107,135,0002,002,0002,404,352
5Jan 2, 2026 19:333,382140,309,547110,594,0001,005,0002,416,640
6Jan 2, 2026 19:333,423135,089,183109,975,0002,999,0002,404,352