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 30, 2025 17:26zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 05:29Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 05:29021,250,1075,426,0007,865,0002,121,728expected "16384 ", got "786 "stderr
2Jul 5, 2026 05:29020,716,7505,366,0007,437,0002,121,728expected "16384 ", got "786 "stderr
3Jul 5, 2026 05:29021,262,2055,419,0007,866,0002,121,728expected "16384 ", got "786 "stderr
4Dec 30, 2025 17:263,611140,876,209113,146,0006,007,0002,293,760
5Dec 30, 2025 17:263,646143,557,816112,300,0008,021,0002,510,848
6Dec 30, 2025 17:263,656145,037,907111,671,0008,973,0002,281,472