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 13:18CodeReclaimersCodeReclaimersScore: 9,587Success
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 13:199,460322,406,930275,502,00036,707,0002,113,536
2Aug 1, 2026 13:199,473323,448,581276,697,00035,944,0002,113,536
3Aug 1, 2026 13:199,489324,019,249276,993,00036,154,0002,113,536
4Aug 1, 2026 13:199,514324,823,469276,582,00037,396,0002,113,536
5Aug 1, 2026 13:199,587327,531,949278,927,00037,464,0002,113,536
6Aug 1, 2026 13:199,597326,790,728279,269,00037,449,0002,113,536
7Aug 1, 2026 13:199,635328,150,491280,319,00037,658,0002,113,536
8Aug 1, 2026 13:199,656329,581,713280,919,00037,744,0002,113,536
9Aug 1, 2026 13:199,698330,861,401281,937,00038,104,0002,113,536