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 03:37Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 08:43Tomislav Tunkovic31.54CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 08:45020,019,942,24420,004,632,0004,168,00020,480Killed by timeout
2Jan 11, 2026 03:374,769188,658,547156,371,0001,002,0002,367,488
3Jan 11, 2026 03:374,781181,424,560155,787,0001,997,0002,465,792
4Jan 11, 2026 03:374,790180,961,506156,066,0002,000,0002,297,856