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 25, 2025 22:17zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 09:50Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 09:50011,729,0092,563,0001,281,0002,121,728expected "16384 ", got "353 "stderr
2Jul 5, 2026 09:50011,598,0592,505,0001,252,0002,121,728expected "16384 ", got "353 "stderr
3Jul 5, 2026 09:50011,581,8292,500,0001,250,0002,121,728expected "16384 ", got "353 "stderr
4Dec 25, 2025 22:173,795149,077,076114,222,00011,021,0002,453,504
5Dec 25, 2025 22:173,811150,193,271113,785,00011,977,0002,293,760
6Dec 25, 2025 22:173,822149,376,288117,116,0009,008,0002,461,696