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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 11:27Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 11:28011,134,0901,666,0001,665,0002,121,728expected "16384 ", got "32 "stderr
2Jul 5, 2026 11:28011,435,3631,646,0001,645,0002,121,728expected "16384 ", got "32 "stderr
3Jul 5, 2026 11:28011,231,6701,664,0001,664,0002,121,728expected "16384 ", got "32 "stderr
4Dec 24, 2025 20:223,894154,107,047121,480,0007,027,0002,449,408
5Dec 24, 2025 20:223,899156,929,420122,695,0005,985,0002,371,584
6Dec 24, 2025 20:223,955155,593,281118,468,00012,047,0002,375,680