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 1, 2026 15:53zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 07:42Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 07:43010,121,97902,048,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 07:4309,753,14102,030,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 07:4309,968,92802,061,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 15:533,685148,389,539120,607,0001,005,0002,506,752
5Jan 1, 2026 15:533,712151,112,380120,497,0002,008,0002,449,408
6Jan 1, 2026 15:533,730145,565,713120,079,0003,001,0002,445,312