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 14, 2026 16:16limanjun99limanjun99Score: 20,097Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 16:1619,614675,501,747643,271,0004,001,0002,506,752
2Mar 14, 2026 16:1619,990692,679,877654,687,0004,997,0002,506,752
3Mar 14, 2026 16:1620,041686,971,174658,354,0002,997,0002,281,472
4Mar 14, 2026 16:1620,095689,556,766659,134,0004,000,0002,514,944
5Mar 14, 2026 16:1620,097696,499,130658,214,0004,994,0002,281,472
6Mar 14, 2026 16:1620,262701,960,053661,661,0006,996,0002,281,472
7Mar 14, 2026 16:1620,322697,428,437663,633,0006,996,0002,506,752
8Mar 14, 2026 16:1620,504706,745,927669,631,0006,996,0002,289,664
9Mar 14, 2026 16:1623,506806,194,526770,716,0004,998,0002,281,472