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 18, 2026 22:48e1011e1011Score: 30,572Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 18, 2026 22:5230,5171,018,066,672990,089,00016,977,0002,113,536
2Oct 18, 2026 22:5230,5281,018,636,190990,695,00016,753,0002,113,536
3Oct 18, 2026 22:5230,5281,018,464,446990,308,00017,120,0002,113,536
4Oct 18, 2026 22:5230,5661,019,757,292992,008,00016,690,0002,113,536
5Oct 18, 2026 22:5230,5721,019,846,488992,159,00016,726,0002,113,536
6Oct 18, 2026 22:5230,5721,019,806,476992,620,00016,266,0002,113,536
7Oct 18, 2026 22:5230,6641,022,936,298995,138,00016,784,0002,113,536
8Oct 18, 2026 22:5230,6801,023,964,549995,659,00016,787,0002,113,536
9Oct 18, 2026 22:5230,7231,025,027,955997,159,00016,713,0002,113,536