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 11, 2026 01:26zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 05:28Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 05:29010,906,2621,041,0002,121,0002,121,728expected "16384 ", got "353 "stderr
2Jul 4, 2026 05:29011,013,3521,542,0001,542,0002,121,728expected "16384 ", got "353 "stderr
3Jul 4, 2026 05:29011,217,3891,040,0002,107,0002,121,728expected "16384 ", got "353 "stderr
4Jan 11, 2026 01:263,086123,481,30298,828,0002,994,0002,408,448
5Jan 11, 2026 01:263,126128,547,082101,157,0002,003,0002,408,448
6Jan 11, 2026 01:263,212129,268,616102,993,0002,999,0002,510,848