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:30e1011e1011Score: 78,560Success
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:3277,9922,584,799,3252,564,859,0008,889,0002,113,536
2Oct 17, 2026 06:3278,1142,588,709,6082,569,383,0008,405,0002,113,536
3Oct 17, 2026 06:3278,1392,590,077,5072,569,848,0008,767,0002,113,536
4Oct 17, 2026 06:3278,3942,597,867,5532,578,644,0008,381,0002,113,536
5Oct 17, 2026 06:3278,5602,604,196,5752,582,805,0009,706,0002,113,536
6Oct 17, 2026 06:3278,6382,606,415,9852,586,730,0008,352,0002,113,536
7Oct 17, 2026 06:3278,7032,608,134,4102,588,837,0008,392,0002,113,536
8Oct 17, 2026 06:3279,4632,633,360,4042,613,936,0008,375,0002,113,536
9Oct 17, 2026 06:3282,7872,742,795,4162,723,686,0008,312,0002,113,536