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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 09:43Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 09:43012,158,7192,682,0001,341,0002,121,728expected "16384 ", got "355 "stderr
2Jul 5, 2026 09:43011,479,6241,867,0001,867,0002,121,728expected "16384 ", got "355 "stderr
3Jul 5, 2026 09:43011,696,1992,636,0001,317,0002,121,728expected "16384 ", got "355 "stderr
4Dec 26, 2025 15:173,796148,620,126116,255,0009,019,0002,387,968
5Dec 26, 2025 15:173,808152,471,884113,708,00011,969,0002,433,024
6Dec 26, 2025 15:173,849148,962,369120,029,0007,001,0002,314,240