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 listSep 25, 2024 13:45Alex KentAlex KentError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 31, 2026 17:37Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 17:40020,021,246,37420,005,928,0004,007,00016,384Killed by timeout
2Oct 31, 2026 17:4023618,346,0214,483,0003,311,0002,117,632
3Sep 25, 2024 13:4523,693804,110,377776,864,0004,999,0002,310,144
4Sep 25, 2024 13:4523,713809,919,380778,545,0003,997,0002,469,888
5Sep 25, 2024 13:4524,251824,547,198795,282,0004,995,0002,469,888