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 18, 2026 01:08Josu San MartinJosu San MartinScore: 4,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 01:084,444177,161,264144,660,0001,995,0002,396,160
2Jan 17, 2026 16:404,446167,513,218145,704,0001,004,0002,387,968
3Jan 17, 2026 16:404,451169,230,562144,897,0001,998,0002,289,664
4Jan 18, 2026 01:084,455170,346,448145,008,0002,000,0002,289,664
5Jan 17, 2026 16:404,464174,732,449144,293,0003,006,0002,289,664
6Jan 18, 2026 01:084,475175,145,337144,690,0002,993,0002,289,664
7Jan 18, 2026 01:0810,392369,700,622340,946,0001,999,0002,330,624
8Jan 18, 2026 01:0810,460368,596,065342,172,0003,001,0002,416,640
9Jan 18, 2026 01:0810,499375,290,164342,459,0003,993,0002,396,160