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 listJan 10, 2026 18:01Josu San MartinJosu San MartinScore: 4,663Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 19:104,658182,466,668151,714,0001,996,0002,400,256
2Jan 10, 2026 18:014,660182,332,775152,798,000998,0002,289,664
3Jan 10, 2026 18:014,663176,436,394150,893,0002,997,0002,289,664
4Jan 10, 2026 19:104,663176,082,008151,866,0001,998,0002,396,160
5Jan 10, 2026 18:014,666180,139,838151,985,0001,999,0002,289,664
6Jan 10, 2026 19:104,670173,791,269152,120,0002,001,0002,289,664