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 listJun 7, 2026 16:07anboto1anboto1Score: 137,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 16:08137,1324,535,236,0964,493,364,00032,024,0002,113,536
2Jun 7, 2026 16:08137,3054,540,970,5224,499,101,00031,995,0002,113,536
3Jun 7, 2026 16:08137,3224,543,713,1564,499,332,00032,301,0002,113,536
4Jun 7, 2026 16:08137,7554,555,759,3994,513,646,00032,298,0002,113,536
5Jun 7, 2026 16:08137,8784,559,473,2504,517,649,00032,329,0002,113,536
6Jun 7, 2026 16:08138,6364,584,380,7694,542,017,00032,987,0002,113,536
7Jun 7, 2026 16:08138,7464,587,992,9494,546,067,00032,561,0002,113,536
8Jun 7, 2026 16:08139,1244,600,883,3394,558,729,00032,371,0002,113,536
9Jun 7, 2026 16:08139,3044,606,469,6674,563,979,00033,079,0002,113,536