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 4, 2026 02:09Josu San MartinJosu San MartinScore: 14,426Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 02:5311,234398,762,915366,722,0003,996,0002,334,720
2Mar 4, 2026 02:0912,103429,272,887395,419,0003,994,0002,326,528
3Mar 4, 2026 02:5312,206429,441,921399,816,0002,998,0002,326,528
4Mar 4, 2026 02:5314,426508,084,176473,061,0003,000,0002,326,528
5Mar 4, 2026 02:0914,675509,831,670481,271,0002,995,0002,334,720
6Mar 4, 2026 02:0915,508542,199,713508,759,0002,998,0002,330,624