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 22:13zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 05:51Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 05:51020,703,5975,312,0007,427,0002,121,728expected "16384 ", got "786 "stderr
2Jul 5, 2026 05:51020,883,1415,393,0007,588,0002,121,728expected "16384 ", got "786 "stderr
3Jul 5, 2026 05:51021,185,7495,367,0007,802,0002,121,728expected "16384 ", got "786 "stderr
4Dec 30, 2025 22:133,650152,175,053111,423,0009,034,0002,506,752
5Dec 30, 2025 22:133,657151,572,634113,698,0006,981,0002,289,664
6Dec 30, 2025 22:133,678150,927,890114,348,0007,021,0002,465,792