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 listOct 25, 2026 05:59Nao MinamiNao MinamiScore: 209,065Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2026 06:01207,5586,860,649,5556,790,469,00058,968,0002,113,536
2Oct 25, 2026 06:01207,9306,873,074,7656,804,407,00057,288,0002,113,536
3Oct 25, 2026 06:01208,9276,905,705,6376,836,131,00058,472,0002,113,536
4Oct 25, 2026 06:01209,0286,909,861,6406,847,799,00050,147,0002,113,536
5Oct 25, 2026 06:01209,0656,910,266,5866,845,561,00053,595,0002,113,536
6Oct 25, 2026 06:01209,6626,929,873,7946,860,511,00058,360,0002,113,536
7Oct 25, 2026 06:01209,7706,933,468,2486,865,390,00057,046,0002,113,536
8Oct 25, 2026 06:01209,8286,935,391,9376,866,126,00058,224,0002,113,536
9Oct 25, 2026 06:01210,1086,944,688,7156,884,337,00049,250,0002,113,536