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 23, 2025 10:03zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 14:38Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 14:38010,984,9061,582,0001,582,0002,121,728expected "16384 ", got "32 "stderr
2Jul 5, 2026 14:38011,043,2351,665,0001,664,0002,121,728expected "16384 ", got "32 "stderr
3Jul 5, 2026 14:38011,088,8441,679,0001,679,0002,121,728expected "16384 ", got "32 "stderr
4Dec 23, 2025 10:034,298164,929,080127,863,00013,985,0002,510,848
5Dec 23, 2025 10:034,338162,575,465132,131,00011,010,0002,379,776
6Dec 23, 2025 10:034,354169,699,448133,709,0009,978,0002,416,640