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 listJul 31, 2026 15:10CodeReclaimersCodeReclaimersScore: 9,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 15:119,126311,548,636264,037,00037,121,0002,113,536
2Jul 31, 2026 15:119,149312,795,048264,847,00037,080,0002,113,536
3Jul 31, 2026 15:119,156313,062,868264,650,00037,498,0002,113,536
4Jul 31, 2026 15:119,168314,374,113265,301,00037,254,0002,113,536
5Jul 31, 2026 15:119,201314,354,783266,400,00037,240,0002,113,536
6Jul 31, 2026 15:119,210314,681,336266,614,00037,317,0002,113,536
7Jul 31, 2026 15:119,248315,401,020267,467,00037,728,0002,113,536
8Jul 31, 2026 15:119,286316,661,883268,780,00037,680,0002,113,536
9Jul 31, 2026 15:119,304317,794,760269,214,00037,836,0002,113,536