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 1, 2026 16:07zielajzielajScore: 3,674Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 16:063,590146,255,550116,473,0002,008,0002,412,544
2Jan 1, 2026 16:063,621145,054,534116,497,0003,012,0002,535,424
3Jan 1, 2026 16:063,629146,818,186118,755,0001,006,0002,351,104
4Jan 1, 2026 16:063,670140,110,334116,117,0005,005,0002,326,528
5Jan 1, 2026 16:073,674149,474,498118,221,0003,005,0002,326,528
6Jan 1, 2026 16:063,680146,291,590118,423,0003,010,0002,338,816
7Jan 1, 2026 16:073,694144,049,127118,889,0002,997,0002,330,624
8Jan 1, 2026 16:073,700149,161,585119,106,0003,002,0002,310,144
9Jan 1, 2026 16:063,719149,058,629119,727,0002,993,0002,322,432