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 listMay 17, 2026 03:24M-RochatM-RochatScore: 19,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 03:2618,955636,582,478622,318,0003,215,0002,113,536
2May 17, 2026 03:2619,012636,410,465624,107,0003,315,0002,113,536
3May 17, 2026 03:2619,225643,168,579631,221,0003,236,0002,113,536
4May 17, 2026 03:2619,239645,731,261631,637,0003,271,0002,113,536
5May 17, 2026 03:2619,368648,027,922635,797,0003,348,0002,113,536
6May 17, 2026 03:2619,470651,876,352639,176,0003,351,0002,113,536
7May 17, 2026 03:2620,582689,030,314676,195,0003,015,0002,113,536
8May 17, 2026 03:2620,609690,585,362677,114,0003,007,0002,113,536
9May 17, 2026 03:2620,616689,776,458676,328,0004,013,0002,113,536