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:22M-RochatM-RochatScore: 18,840Success
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:2318,651624,355,785612,269,0003,236,0002,113,536
2May 17, 2026 03:2318,681637,397,141613,211,0003,280,0002,113,536
3May 17, 2026 03:2318,696625,921,704613,795,0003,205,0002,113,536
4May 17, 2026 03:2318,817631,185,579617,630,0003,340,0002,113,536
5May 17, 2026 03:2318,840632,497,163618,581,0003,155,0002,113,536
6May 17, 2026 03:2318,873632,522,029619,618,0003,219,0002,113,536
7May 17, 2026 03:2318,914633,258,123620,887,0003,290,0002,113,536
8May 17, 2026 03:2319,007636,104,476623,997,0003,252,0002,113,536
9May 17, 2026 03:2319,080640,084,497626,388,0003,261,0002,113,536