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 listAug 1, 2026 12:43CodeReclaimersCodeReclaimersScore: 9,626Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 12:449,571326,130,100311,439,0004,406,0002,113,536
2Aug 1, 2026 12:449,601326,934,469312,544,0004,298,0002,113,536
3Aug 1, 2026 12:449,605327,107,020312,660,0004,317,0002,113,536
4Aug 1, 2026 12:449,620328,382,322313,108,0004,366,0002,113,536
5Aug 1, 2026 12:449,626328,449,088313,327,0004,340,0002,113,536
6Aug 1, 2026 12:449,676330,302,004314,935,0004,405,0002,113,536
7Aug 1, 2026 12:449,722331,056,191316,407,0004,449,0002,113,536
8Aug 1, 2026 12:449,727331,217,907316,581,0004,439,0002,113,536
9Aug 1, 2026 12:449,835334,747,386320,083,0004,490,0002,113,536