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 listOct 20, 2026 20:58janwwwjanwwwScore: 9,585Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 20:599,534325,504,858310,505,0004,136,0002,113,536
2Oct 20, 2026 20:599,563326,309,560312,450,0003,146,0002,113,536
3Oct 20, 2026 20:599,581326,993,539312,885,0003,292,0002,113,536
4Oct 20, 2026 20:599,582327,232,039313,080,0003,154,0002,113,536
5Oct 20, 2026 20:599,585327,094,014313,011,0003,323,0002,113,536
6Oct 20, 2026 20:599,644329,002,418315,130,0003,133,0002,113,536
7Oct 20, 2026 20:599,647329,230,073315,202,0003,177,0002,113,536
8Oct 20, 2026 20:599,665329,658,639315,767,0003,180,0002,113,536
9Oct 20, 2026 20:599,710332,756,985316,267,0004,194,0002,113,536