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 listMar 18, 2026 02:42Josu San MartinJosu San MartinScore: 4,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 02:474,604175,152,416149,921,0001,998,0002,289,664
2Mar 18, 2026 02:434,605176,210,126150,968,000999,0002,400,256
3Mar 18, 2026 02:474,607178,224,171150,016,0002,000,0002,289,664
4Mar 18, 2026 02:434,611174,112,795151,154,0001,001,0002,289,664
5Mar 18, 2026 02:474,614175,044,757152,248,00002,383,872
6Mar 18, 2026 02:434,623174,226,519151,552,000997,0002,289,664
7Mar 18, 2026 02:425,134194,309,932169,438,00002,400,256
8Mar 18, 2026 02:425,141196,667,287167,667,0001,996,0002,396,160
9Mar 18, 2026 02:425,143199,779,102168,705,000998,0002,285,568