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 16, 2026 20:50KacpxerKacpxerScore: 14,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 20:5113,894469,288,173405,404,00053,129,0002,113,536
2Oct 16, 2026 20:5113,934470,678,882406,181,00053,641,0002,113,536
3Oct 16, 2026 20:5114,101476,022,086410,640,00054,709,0002,113,536
4Oct 16, 2026 20:5114,155477,797,445412,016,00055,113,0002,113,536
5Oct 16, 2026 20:5114,176478,292,017412,789,00055,033,0002,113,536
6Oct 16, 2026 20:5114,179478,488,735412,974,00054,956,0002,113,536
7Oct 16, 2026 20:5114,199479,080,876412,820,00055,764,0002,113,536
8Oct 16, 2026 20:5114,216479,777,584414,273,00054,887,0002,113,536
9Oct 16, 2026 20:5114,411486,136,165420,769,00054,817,0002,113,536