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 17, 2026 06:18e1011e1011Score: 68,868Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 06:2067,9672,254,487,8572,226,206,00016,733,0002,113,536
2Oct 17, 2026 06:2068,4272,269,096,1422,242,400,00015,708,0002,113,536
3Oct 17, 2026 06:2068,5132,271,665,5582,245,181,00015,780,0002,113,536
4Oct 17, 2026 06:2068,7562,280,384,1382,253,431,00015,535,0002,113,536
5Oct 17, 2026 06:2068,8682,284,014,4022,257,121,00015,553,0002,113,536
6Oct 17, 2026 06:2068,9222,285,304,8802,258,893,00015,551,0002,113,536
7Oct 17, 2026 06:2070,0432,322,317,2482,295,446,00015,987,0002,113,536
8Oct 17, 2026 06:2070,3592,332,627,0782,306,412,00015,457,0002,113,536
9Oct 17, 2026 06:2071,0432,356,006,7892,327,712,00016,720,0002,113,536