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 listMar 17, 2026 14:28Josu San MartinJosu San MartinScore: 4,046Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 11, 2026 07:53Victor Mercklé10.00RecheckSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 07:544,033144,932,752131,981,0001,115,0002,113,536
2May 11, 2026 07:544,046144,403,198132,407,0001,121,0002,113,536
3May 11, 2026 07:544,053144,357,219132,641,0001,131,0002,113,536
4Mar 17, 2026 14:284,075159,298,559133,471,0001,003,0002,383,872
5Mar 17, 2026 14:284,076159,018,988134,495,00002,289,664
6Mar 17, 2026 14:284,076161,688,221133,509,0001,003,0002,408,448