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 11, 2026 16:10Josu San MartinJosu San MartinScore: 5,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 16:094,765184,097,007155,228,0002,002,0002,351,104
2Jan 11, 2026 16:094,768182,589,519155,329,0002,004,0002,351,104
3Jan 11, 2026 16:094,778186,901,333155,675,0001,995,0002,314,240
4Jan 11, 2026 16:105,747217,356,666187,658,0001,996,0002,330,624
5Jan 11, 2026 16:105,758215,232,998187,011,0003,000,0002,330,624
6Jan 11, 2026 16:106,712249,872,057219,506,0001,995,0002,363,392
7Jan 11, 2026 16:107,974286,413,959263,136,00002,363,392
8Jan 11, 2026 16:108,087289,160,817265,884,000999,0002,355,200
9Jan 11, 2026 16:108,161290,602,146268,304,0001,001,0002,363,392